.png){kind=icon}
.png){kind=icon}
Return
Improved linear programming relaxations for flow shop problems with makespan minimization
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2024.106970.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Machine scheduling problems with makespan minimization have been addressed in various academic and industrial fields using mixed-integer programming (MIP). Inmost MIP models, however, the makespan variable is poorly linked to the natural date variables of jobs. To address this, we propose novel, strengthening inequalities, derived from the single-machine scheduling polyhedron augmented by a makespan variable. While the associated optimization problem fora single machine is trivial, these inequalities can be applied as cutting planes to more complicated scheduling problems. In this work, we demonstrate their use for non- permutation flow shops. Using the Taillard benchmark set, we analyze the effect of the inequalities on the linear programming relaxations and mixed-integer programs of three commonly used MIP models. The experiments show that the inequalities significantly improve the ability of linear-ordering and time-indexed models to bound the optimum. The positive effect also extends to linear-ordering models with changeover times, demonstrating the potential of these inequalities to improve more general, application-oriented flow shop problems.
Keywords:
Flow shops
Makespan minimization
Mixed-integer programming
Scheduling polytope
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W