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

dc.contributor.authorYanıkoğlu, İhsan
dc.contributor.authorYavuz, Tonguç
dc.contributor.departmentIndustrial Engineering
dc.contributor.ozuauthorYANIKOĞLU, Ihsan
dc.contributor.ozugradstudentYavuz, Tonguç
dc.date.accessioned2023-06-14T07:26:56Z
dc.date.available2023-06-14T07:26:56Z
dc.date.issued2022-09-16
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.en_US
dc.description.sponsorshipHome Appliances Department of the Vestel Electronics Company
dc.identifier.doi10.1016/j.ejor.2021.11.023en_US
dc.identifier.endpage895en_US
dc.identifier.issn0377-2217en_US
dc.identifier.issue3en_US
dc.identifier.scopus2-s2.0-85120828000
dc.identifier.startpage875en_US
dc.identifier.urihttp://hdl.handle.net/10679/8399
dc.identifier.urihttps://doi.org/10.1016/j.ejor.2021.11.023
dc.identifier.volume301en_US
dc.identifier.wos000795495800006
dc.language.isoengen_US
dc.peerreviewedyesen_US
dc.publicationstatusPublisheden_US
dc.publisherElsevieren_US
dc.relation.ispartofEuropean Journal of Operational Research
dc.relation.publicationcategoryInternational Refereed Journal
dc.rightsrestrictedAccess
dc.subject.keywordsBranch-and-priceen_US
dc.subject.keywordsInteger programmingen_US
dc.subject.keywordsParallel machine schedulingen_US
dc.subject.keywordsRobust optimizationen_US
dc.subject.keywordsRobust optimizationen_US
dc.titleBranch-and-price approach for robust parallel machine scheduling with sequence-dependent setup timesen_US
dc.typearticleen_US
dspace.entity.typePublication
relation.isOrgUnitOfPublication5dd73c02-fd2d-43e0-9a23-71bab9ae0b6b
relation.isOrgUnitOfPublication.latestForDiscovery5dd73c02-fd2d-43e0-9a23-71bab9ae0b6b

Files

License bundle

Now showing 1 - 1 of 1
Placeholder
Name:
license.txt
Size:
1.45 KB
Format:
Item-specific license agreed upon to submission
Description: