期刊論文
| 學年 | 106 |
|---|---|
| 學期 | 2 |
| 出版（發表）日期 | 2018-04-04 |
| 作品名稱 | Minimizing makespan in distributed mixed no-idle flowshops |
| 作品名稱（其他語言） | |
| 著者 | Chen-Yang Chen; Kuo-Ching Ying; Hsia-Hsiang Chen; Hsiao-Shan Lu |
| 單位 | |
| 出版者 | |
| 著錄名稱、卷期、頁數 | International Journal of Production Research 57(1), p. 48-60 |
| 摘要 | The rapid growth of distributed manufacturing in industry today has recently attracted significant research attention that has focused on distributed scheduling problems. This work studied the distributed mixed no-idle flowshop scheduling problem using makespan as an optimality criterion. To the best of the authors’ knowledge, this is the first paper to study the multi-flowshop extension in which each flowshop has mixed no-idle constraints. A novel cloud theory-based iterated greedy (CTBIG) algorithm was proposed for solving the problem. Computational experiments conducted on a set of test instances revealed that the proposed CTBIG algorithm significantly outperformed classic iterated greedy algorithms. |
| 關鍵字 | scheduling;makespan;metaheuristics;distributed mixed no-idle flowshop;cloud theory-based iterated greedy algorithm |
| 語言 | en |
| ISSN | 1366-588X; 0020-7543 |
| 期刊性質 | 國外 |
| 收錄於 | SCI |
| 產學合作 | |
| 通訊作者 | |
| 審稿制度 | 是 |
| 國別 | GBR |
| 公開徵稿 | |
| 出版型式 | ,電子版,紙本 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/122975 ) |