๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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

โœ Scribed by Lu, Chung-Cheng; Lin, Shih-Wei; Ying, Kuo-Ching

Book ID
125514864
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
686 KB
Volume
23
Category
Article
ISSN
1568-4946

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

๐Ÿ“œ SIMILAR VOLUMES

Minimizing the makespan on a single mach
Minimizing the makespan on a single machine with learning and unequal release times
โœ Chin-Chia Wu; Chin-Liang Liu ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 202 KB

The importance of the ready times can be found in Wafer fabrication with the presence of unequal ready times. It is sometimes advantageous to form a non-full batch, while in other situations it is a better strategy to wait for future job arrivals in order to increase the fullness of the batch. On th