Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times

Basit Öğe Kaydı
dc.authoridYanıkoğlu, İhsan/0000-0002-7216-4739|yavuz, tonguc/0000-0003-0187-0588
dc.authorwosidyavuz, tonguc/KIJ-8768-2024
dc.authorwosidYanıkoğlu, İhsan/A-4739-2015
dc.contributor.authorYanikoglu, Ihsan
dc.contributor.authorYavuz, Tonguc
dc.date.accessioned2024-07-18T20:42:34Z
dc.date.available2024-07-18T20:42:34Z
dc.date.issued2022
dc.departmentİstanbul Bilgi Üniversitesien_US
dc.description.abstractThis 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.en_US
dc.identifier.doi10.1016/j.ejor.2021.11.023
dc.identifier.endpage895en_US
dc.identifier.issn0377-2217
dc.identifier.issn1872-6860
dc.identifier.issue3en_US
dc.identifier.scopus2-s2.0-85120828000en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage875en_US
dc.identifier.urihttps://doi.org/10.1016/j.ejor.2021.11.023
dc.identifier.urihttps://hdl.handle.net/11411/7343
dc.identifier.volume301en_US
dc.identifier.wosWOS:000795495800006en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofEuropean Journal of Operational Researchen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectInteger Programmingen_US
dc.subjectRobust Optimizationen_US
dc.subjectBranch-And-Priceen_US
dc.subjectParallel Machine Schedulingen_US
dc.subjectFuzzy Processing Timesen_US
dc.subjectAlgorithmsen_US
dc.subjectMakespanen_US
dc.subjectEligibilityen_US
dc.subjectHeuristicsen_US
dc.subjectEarlinessen_US
dc.subjectJobsen_US
dc.titleBranch-and-price approach for robust parallel machine scheduling with sequence-dependent setup timesen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

Web of Science Indexed Publications
Scopus Indexed Publications