MIP models for minimizing total tardiness in a two‐machine flow shop

MIP models for minimizing total tardiness in a two‐machine flow shop

0.00 Avg rating0 Votes
Article ID: iaor20132536
Volume: 64
Issue: 5
Start Page Number: 690
End Page Number: 707
Publication Date: May 2013
Journal: Journal of the Operational Research Society
Authors: ,
Keywords: programming: integer
Abstract:

We propose compact mixed‐integer programming models for the ‐hard problem of minimizing tardiness in a two‐machine flow shop. Also, we propose valid inequalities that aim at tightening the models’ representations. We provide empirical evidence that the linear programming relaxation of an enhanced formulation yields an excellent lower bound that consistently outperforms the best bound from the literature. We further provide the results of extensive computational experiments that attest to the efficacy of the proposed MIP models. In particular, our computational study reveals that most of the 30‐job hard instances are optimally solved using the proposed MIP models. Furthermore, we found that even much larger instances, with up to 70 jobs, can be solved for several problem classes.

Reviews

Required fields are marked *. Your email address will not be published.