Title of article
Comparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
Author/Authors
Samarghandi, Hamed Department of Finance and Management Science - Edwards School of Business - University of Saskatchewan, Saskatoon, Saskatchewan, Canada , Firouzi Jahantigh, Farzad Department of Industrial Engineering - University of Sistan and Baluchestan, Zahedan, Iran
Pages
8
From page
17
To page
24
Abstract
The impetus for this research was examining a flow shop problem in which tasks were expected to
be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they
should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated
based on makespan. To solve the NP-Hard problem, we developed two mathematical models. Once we solved
our problem using Mixed-Integer Programming Model (henceforth MIPM) and then, we applied a Constraint
Programming Model (CPM); finally, we compared the optimality of the presented results.
Keywords
Constraint programming model , Specific deadlines , Mixed-integer programming model , Flow shop scheduling , Makespan
Journal title
Astroparticle Physics
Serial Year
2019
Record number
2469086
Link To Document