A due-date oriented scheduling heuristic for job shop cellular manufacturing system
檔案
本條目沒有附加檔案。
日期
2000-03-01
類型
系所
期刊名稱
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE
卷期與頁次
第 7 卷第 1 期,頁 76–88
ISSN
1072-4761
語言
英文
摘要
Although having gained further insight into scheduling problems involving cellular manufacturing systems, previous research has neglected two characteristics that are essential for effective group scheduling: first, due-date performance focus; second, setup time savings by emphasizing constrained and non-constrained machines. To overcome these two characteristics, we present a due-date oriented scheduling heuristic algorithm for jab shop cellular manufacturing system based on Capacity Constraint Resource (CCR). The proposed algorithm consists of four stages: (1) schedule development for CCR (DRUM), (2) CCR setup time savings to decrease mean tardiness, (3) CCR setup time savings to maximize CCR throughput, and (4) development of a hybrid scheduling method to minimize total flowtime and the work-in-process (WIP) inventory. Also, an illustrative example demonstrates the feasibility of the proposed method. Significance: This study has developed a due-date oriented scheduling heuristic algorithm for job shop cellular manufacturing environments. The proposed algorithm's strong performance indicates that our four-stage group scheduling heuristic, with its more sensitive switching procedures, can not only overcome some of the weaknesses shown by exhaustive and non-exhaustive scheduling heuristics, but can also glean setup time savings without sacrificing due-date performance.
所屬典藏
期刊論文引用此條目
Tsai, C., & Li, R. (2000). A due-date oriented scheduling heuristic for job shop cellular manufacturing system. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 7(1), 76–88. https://ir.lib.nycu.edu.tw/handle/11536/30660
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/30660