查詢結果分析
相關文獻
- 以最大延遲時間為準則之單機群組排程問題
- 最小化總流程時間之單階群組排程研究
- 考慮整備時間與指定途程的群組排程法
- 考量整備時間之彈性零工型製造系統排程問題研究
- A Bottleneck-Based Group Scheduling Procedure for Job-Shop Cells
- A New Packet Reservation Multiple Access Protocol to Integrate Voice and Data Sources
- Single Machine Scheduling with Due Dates and Class Setups
- Manufacturing Cell Formation Using Genetic Algorithm VS. Neural Networks
- Application of Group Scheduling Heuristics to the Demand-Driven Flexible Flow System
- Effect of Cell Transfer Batches on Group Scheduling in a Flow Shop Cellular System
頁籤選單縮合
題 名 | 以最大延遲時間為準則之單機群組排程問題=Single Facility, Group Scheduling with Respect to Maximum Tardiness Problem |
---|---|
作 者 | 黃榮華; | 書刊名 | 工業工程學刊 |
卷 期 | 15:4 1998.07[民87.07] |
頁 次 | 頁411-418 |
分類號 | 494.542 |
關鍵詞 | 群組排程; 工件族; 整備時間; 製程時間; 最大延遲時間; Group scheduling; Part family; Setup time; Make span; Maximum tardiness; |
語 文 | 中文(Chinese) |
中文摘要 | 生產排程與群組技術的結合,稱之為群組排程。將個別工件依一定的屬性或製程 ,透過分類及編碼而形成工作族。因此,生產系統可配合工件族指派到特定的機器群來設 計。本文考慮單機加工中心,可處理若干工件族之加工作業的排程問題,機器若連續處理同 一族之工作時,不需再有整備時間,若換族加工時則需要整備時間,這和一般排程將整備時 間併入處理時間而不受加工順序影響的假設不同。實務上,若能有效地實施群組排程將可減 少整備次數而縮短製程時間。本文以最大延遲時間為續效衡量準則進行研究,因為問題本質 為 NP-hard,故先發展出一探索示演算法。並以之為起始解,配合凌越條件及下界值,建立 分枝界限法。經由資料測試結果顯示這些方法均十分有效。 |
英文摘要 | 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 facility 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 maximum tardiness. Since this problem is NP-hard, we developed a heuristic approach to derive a sub-optimal solution; this solution ws then used as the initial point of branch and bound procedure. Furthermore, several dominant rules and a lower bound of the optimal tardiness were developed. The computational results indicate the algorithms we developed are all highly efficient. |
本系統中英文摘要資訊取自各篇刊載內容。