A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date

Shih Wei Lin, Shuo Yan Chou*, Kuo Ching Ying

*此作品的通信作者

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

38 引文 斯高帕斯(Scopus)

摘要

This study focuses on a class of single-machine scheduling problems with a common due date where the objective is to minimize the total earliness-tardiness penalty for the jobs. A sequential exchange approach utilizing a job exchange procedure and three previously established properties in common due date scheduling was developed and tested with a set of benchmark problems. The developed approach generates results better than not only those of the existing dedicated heuristics but also in many cases those of meta-heuristic approaches. And the developed approach performs consistently well in various job settings with respect to the number of jobs, processing time and earliness-tardiness penalties for the jobs.

原文英語
頁(從 - 到)1294-1301
頁數8
期刊European Journal of Operational Research
177
發行號2
DOIs
出版狀態已出版 - 01 03 2006
對外發佈

指紋

深入研究「A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date」主題。共同形成了獨特的指紋。

引用此