查詢結果分析
相關文獻
- 最小化總流程時間之單階群組排程研究
- 以最大延遲時間為準則之單機群組排程問題
- 考慮整備時間與指定途程的群組排程法
- 相依整備時間考量下具等效平行機臺之多階段流程型排程問題啟發式求解模式建構
- Bicriteria Dynamic Scheduling in Multi-Machine Flowshop
- 考量整備時間之彈性零工型製造系統排程問題研究
- 應用啟發式方法解決預燒製程單一爐子排程之研究
- A Bottleneck-Based Group Scheduling Procedure for Job-Shop Cells
- Manufacturing Cell Formation Using Genetic Algorithm VS. Neural Networks
- Application of Group Scheduling Heuristics to the Demand-Driven Flexible Flow System
頁籤選單縮合
題 名 | 最小化總流程時間之單階群組排程研究=Minimizing Total Flow Time of Group Scheduling for the Single Production Stage |
---|---|
作 者 | 黃榮華; | 書刊名 | 輔仁管理評論 |
卷 期 | 12:1 2005.01[民94.01] |
頁 次 | 頁147-165 |
分類號 | 494.542 |
關鍵詞 | 群組排程; 工件族; 整備時間; 製程時間; 總流程時間; Group scheduling; Part family; Setup time; Make span; Flow time; |
語 文 | 中文(Chinese) |
中文摘要 | 群組化生產系統之排程作業簡稱為群組排程。將個別工作依特定的屬性或製程,透過分類及編碼而形成工件族,因此,生產系統可配合工作族指派到專屬的機器群來設計。本文考慮單階加工中心,可處理若干工件族之加工作業的排程問題,機器若連續處理同一族之工件時,不受加工順序影響的佑設不同。實務上,若能有效地實族群組排程將可減少整備次敗而縮短製程時間。本文以總流程時間為績效衡量準則進行研究,因為問題本質為NP-hard,故求解工作分兩部分進行,首先發展出一探索式演算法,能迅速地求得最佳解或近似最佳解,經由資料測試結果顯示,最佳解題率均高達90%以上,而平均求解時間則不到分枝界限法的百分之一。再者,以探索式所得結果作為起始解,配合凌越條件及下界值的建構,提出整合式分枝界限法,能夠在合理的時間內,求得最佳解。 |
英文摘要 | The integration of production scheduling with group technology has come to be called group scheduling. In this system, the classification and coding procedure for each so called part family is arranged according to the similarity of the attributes or manufacturing processes of the individual components. Under this system, therefore, a production system relating each part family to a specific machine group can be designed. The present study limits itself to the scheduling problems associated with single stage GT processing centers. In this context, we find that although a new setup is required when moving between jobs of different families, no new setup is required when moving between jobs of the same family. This is different from the traditional research of scheduling which assumes the setup time for a job is independent of job sequencing and, therefore, could be included in the processing time for each job. Our study found that by effectively implementing group scheduling the number of setups was reduced and consequently the make span was diminished. Our study addressed most specifically performance measures of total flow time. Since this problem is NP-hard, we developed a heuristic approach to derive a sub-optimal solution. The computational results indicate the heuristic approach we developed a very high rate to get the optimal solution, above 90%, and its running time is really short. The solution was them used as the initial point of branch and bound procedure. Further, several dominate rules and a lower bound of the optimal flow time were developed. The integrated branch and bound procedure we developed can get the optimal solution within reasonable time. |
本系統中英文摘要資訊取自各篇刊載內容。