Minimizing makespan for no-wait flowshop scheduling problems with setup times

Kuo Ching Ying, Shih Wei Lin*

*此作品的通信作者

研究成果: 期刊稿件文章同行評審

20 引文 斯高帕斯(Scopus)

摘要

This study investigates no-wait flowshop scheduling problems with sequence-independent and sequence-dependent setup times aimed at minimizing the makespan. We propose an efficient two-phase matheuristic, which can optimally solve all tested instances of three existing benchmark problem sets and a new generated large-sized test problem set, with up to 20-machine and 2000-job test instances, in acceptable computational times. This is a dramatic improvement over all previously known algorithms. In view of the strongly NP-complete nature of the two problems addressed herein, this study contributes an exact method that can find optimal solutions for solving these problems with the efficiency necessary to meet real-world scheduling requirements.

原文英語
頁(從 - 到)73-81
頁數9
期刊Computers and Industrial Engineering
121
DOIs
出版狀態已出版 - 07 2018
對外發佈

文獻附註

Publisher Copyright:
© 2018 Elsevier Ltd

指紋

深入研究「Minimizing makespan for no-wait flowshop scheduling problems with setup times」主題。共同形成了獨特的指紋。

引用此