Constraint programming models for the hybrid flow shop scheduling problem and its extensions

Simple item page
dc.contributor.authorIşık E.E.
dc.contributor.authorTopaloglu Yildiz S.
dc.contributor.authorŞatır Akpunar Ö.
dc.date.accessioned2024-07-22T08:02:05Z
dc.date.available2024-07-22T08:02:05Z
dc.date.issued2023
dc.description.abstractProper scheduling of jobs is essential for modern production systems to work effectively. The hybrid flow shop scheduling problem is a scheduling problem with many applications in the industry. The problem has also attracted much attention from researchers due to its complexity. This study addresses the hybrid flow shop scheduling problem (HFSP), which considers unrelated parallel machines at each stage and the machine eligibility constraints. HFSP is a well-known NP-hard problem with the aim of minimizing the makespan. Owing to the complexity of the problem, this study develops constraint programming (CP) models for the HFSP and its extensions: the no-wait HFSP, the blocking HFSP, the HFSP with sequence-dependent setup times, the no-wait HFSP with sequence-dependent setup times, and the blocking HFSP with sequence-dependent setup times. We also propose two mixed-integer linear programming models (MILP) for no-wait and blocking HSFPs with sequence-dependent setup times. The performances of the CP models were tested against their MILP counterparts using randomly generated instances and benchmark instances from the literature. The computational results indicated that the proposed CP model outperformed the best MILP solutions for benchmark instances. It is also more effective for finding high-quality solutions for larger problem instances. © 2023, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.
dc.identifier.DOI-ID10.1007/s00500-023-09086-9
dc.identifier.issn14327643
dc.identifier.urihttp://akademikarsiv.cbu.edu.tr:4000/handle/123456789/11706
dc.language.isoEnglish
dc.publisherSpringer Science and Business Media Deutschland GmbH
dc.subjectBenchmarking
dc.subjectComputational complexity
dc.subjectConstraint theory
dc.subjectInteger programming
dc.subjectJob shop scheduling
dc.subjectMachine shop practice
dc.subjectBlockings
dc.subjectConstraint programming
dc.subjectConstraint programming model
dc.subjectFlow shop scheduling problem
dc.subjectHybrid flow shop scheduling
dc.subjectInteger Linear Programming
dc.subjectMixed integer linear
dc.subjectMixed-integer linear programming
dc.subjectNo wait
dc.subjectSequence-dependent setup time
dc.subjectConstraint programming
dc.titleConstraint programming models for the hybrid flow shop scheduling problem and its extensions
dc.typeArticle

Files

Collections

Scopus Koleksiyonu