Abstract This paper discusses a two machines permutation flow-shop scheduling problem with uncertain job processing times, where the criterion is the weighted earliness and tardiness. Uncertain processing times are described by interval scenarios, and a robust scheduling model is established to minimize the maximum penalties for earliness and tardiness. The property for the worst-case scenario of processing times is discussed for this scheduling model. Based on the obtained conclusion, a two-layer harmony search algorithm is proposed to address the characteristic of two-layer searching space. The inner-layer harmony search algorithm is used for searching the scenario space for a given schedule, while the outer-layer harmony search algorithm is used for searching the min-max schedule space. Finally, an extensive experiment is conducted to testify the effectiveness of the proposed algorithm and the characteristics of the min-max robust solution obtained.
Two-Layer Harmony Search Algorithm for a Robust Flow Shop Scheduling Problem
2017-01-01
10 pages
Article/Chapter (Book)
Electronic Resource
English
Resource constrained project scheduling by harmony search algorithm
Online Contents | 2017
|Resource constrained project scheduling by harmony search algorithm
Springer Verlag | 2017
|Harmony filter: A robust visual tracking system using the improved harmony search algorithm
British Library Online Contents | 2010
|Scheduling Algorithm for the Job Shop Scheduling Problem
IEEE | 2007
|Flexible job‐shop scheduling problem by genetic algorithm
Online Contents | 2011
|