Minimizing worst-case regret of makespan on a single machine with uncertain processing and setup times

Chung-Cheng Lu, Shih Wei Lin*, Kuo Ching Ying

*此作品的通信作者

研究成果: Article同行評審

23 引文 斯高帕斯(Scopus)

摘要

This research addresses a single machine scheduling problem with uncertain processing times and sequence-dependent setup times represented by intervals. Our objective is to obtain a robust schedule with the minimum absolute deviation from the optimal makespan in the worst-case scenario. The problem is reformulated as a robust traveling salesman problem (RTSP), whereby a property is utilized to efficiently identify worst-case scenarios. A local search-based heuristic that incorporates this property is proposed to solve the RTSP, along with a simulated annealing-based implementation. The effectiveness and efficiency of the proposed heuristic are compared to those of an exact solution method in the literature.

原文English
頁(從 - 到)144-151
頁數8
期刊Applied Soft Computing Journal
23
DOIs
出版狀態Published - 1 1月 2014

指紋

深入研究「Minimizing worst-case regret of makespan on a single machine with uncertain processing and setup times」主題。共同形成了獨特的指紋。

引用此