The hybrid flexible flowshop with transportation times

Loading...
Thumbnail Image
Files
LIPIcs-CP-2021-16.pdf(855.79 KB)
Published Version
cp2021.mzn(1.78 KB)
Additional file 2
cp2021.zip(1.12 MB)
Additional file 3
Date
2021-10-15
Authors
Armstrong, Eddie
Garraffa, Michele
O'Sullivan, Barry
Simonis, Helmut
Journal Title
Journal ISSN
Volume Title
Publisher
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Research Projects
Organizational Units
Journal Issue
Abstract
This paper presents the hybrid, flexible flowshop problem with transportation times between stages, which is an extension of an existing scheduling problem that is well-studied in the literature. We explore different models for the problem with Constraint Programming, MILP, and local search, and compare them on generated benchmark problems that reflect the problem of the industrial partner. We then study two different factory layout design problems, and use the optimization tool to understand the impact of the design choices on the solution quality.
Description
Keywords
Constraint Programming , Scheduling , Hybrid flowshop
Citation
Armstrong, E., Garraffa, M., O'Sullivan, B. and Simonis, H. (2021) 'The hybrid flexible flowshop with transportation times', 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), Montpellier, France, 25 - 29 October, 16 (18pp). doi: 10.4230/LIPIcs.CP.2021.16
Link to publisher’s version