Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
Küçük Resim Yok
Tarih
2022
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Elsevier
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
This paper studies a machine scheduling problem that minimizes the worst-case total tardiness for unrelated parallel machines with sequence-dependent setup and uncertain processing times. We propose a robust optimization reformulation of the related machine scheduling problem and discuss several important properties of the mathematical model and the reformulation approach. The proposed model generalizes robust parallel machine scheduling problems by including sequence-dependent setup times and ellipsoidal uncertainty sets. Another key contribution of the paper is to show that scheduling problems usually have alternative optimal solutions for the worst-case tardiness objective, whose performance under nominal processing times may vary or vice a versa. This issue has been addressed by studying the Pareto efficient extensions of the proposed robust optimization models to provide solutions that are immune to changes in processing times. A branch-and-price algorithm has been developed to solve realistically sized instances in less than one hour, which a commercial solver cannot achieve. Numerical results show the effectiveness of the proposed approach since realistically sized instances such as (4 machines, 32 jobs) and (150 machines, 300 jobs) can be solved to optimality within the time limit, and the (average) objective function value improvement made by the robust approach can get as high as 56% compared with the (nominal) optimal solutions that ignore uncertainty in problem data.(c) 2021 Elsevier B.V. All rights reserved.
Açıklama
Anahtar Kelimeler
Integer Programming, Robust Optimization, Branch-And-Price, Parallel Machine Scheduling, Fuzzy Processing Times, Algorithms, Makespan, Eligibility, Heuristics, Earliness, Jobs
Kaynak
European Journal of Operational Research
WoS Q Değeri
Q1
Scopus Q Değeri
Q1
Cilt
301
Sayı
3
