A due-date oriented scheduling heuristic for job shop cellular manufacturing system
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
88 | en_US |
dc.citation.issue |
1 | en_US |
dc.citation.spage |
76 | en_US |
dc.citation.volume |
7 | en_US |
dc.citation.woscount |
4 | |
dc.contributor.author |
Tsai, CH | en_US |
dc.contributor.author |
Li, RK | en_US |
dc.contributor.department |
工業工程與管理學系 | zh_TW |
dc.contributor.department |
Department of Industrial Engineering and Management | en_US |
dc.date.accessioned |
2014-12-08T15:45:34Z | |
dc.date.available |
2014-12-08T15:45:34Z | |
dc.date.issued |
2000-03-01 | en_US |
dc.description.abstract |
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. | en_US |
dc.identifier.issn |
1072-4761 | en_US |
dc.identifier.journal |
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/30660 | |
dc.identifier.wosnumber |
WOS:000086359500009 | |
dc.language.iso |
en_US | en_US |
dc.subject |
flowtime | en_US |
dc.subject |
TOC | en_US |
dc.subject |
DBR | en_US |
dc.subject |
Capacity Constraint Resource (CCR) | en_US |
dc.subject |
hybrid scheduling | en_US |
dc.title |
A due-date oriented scheduling heuristic for job shop cellular manufacturing system | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文
引用此條目
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