Exact algorithms for single-machine scheduling problems with a variable maintenance

Kuo Ching Ying, Chung-Cheng Lu*, Jhao Cheng Chen

*此作品的通信作者

研究成果: Article同行評審

31 引文 斯高帕斯(Scopus)

摘要

This paper deals with four single-machine scheduling problems (SMSPs) with a variable machine maintenance. The objectives of the four SMSPs are to minimize mean lateness, maximum tardiness, total flow time and mean tardiness, respectively. These four SMSPs are important in the literature and in practice. This study proposes an exact algorithm with the computational complexity O(n2) for each of the four SMSPs. In addition to the given jobs, the machine maintenance activity between two consecutive jobs is optimally scheduled.

原文English
頁(從 - 到)427-433
頁數7
期刊Computers and Industrial Engineering
98
DOIs
出版狀態Published - 1 8月 2016

指紋

深入研究「Exact algorithms for single-machine scheduling problems with a variable maintenance」主題。共同形成了獨特的指紋。

引用此