Single machine scheduling with sequence-dependent setup times and delayed precedence constraints

Yiyo Kuo*, Sheng-I Chen, Yen Hung Yeh

*此作品的通信作者

研究成果: Article同行評審

3 引文 斯高帕斯(Scopus)

摘要

This research deals with the single machine scheduling problem of minimizing the makespan with sequence dependent setup times and delayed precedence constraints. A makespan calculation model is first proposed. When given a feasible job sequence, the proposed model can calculate the makespan. Then a variable neighbourhood search (VNS) with four phases is proposed for optimizing the job sequence. The proposed VNS adopts five operations to search for new solutions, and modifies all solutions to satisfy precedence constraints. The proposed VNS will accept a worse solution over a better solution with a certain probability, in order to escape from a local optimum. The experimental results show that the proposed VNS provides the best results with less than 10 s of computation time. Therefore it is efficient and effective in solving the single machine scheduling problems.

原文English
頁(從 - 到)1-16
頁數16
期刊Operational Research
DOIs
出版狀態Published - 21 九月 2017

指紋

深入研究「Single machine scheduling with sequence-dependent setup times and delayed precedence constraints」主題。共同形成了獨特的指紋。

引用此