Lower Bounds for the Two-Machine Flow Shop Problem with Time Delays

Mohamed Amine Mkadem (1) , Aziz Moukrim (2, 1) , Mehdi Serairi (1, 2)

1 Heudiasyc - Heuristique et Diagnostic des Systèmes Complexes [Compiègne]
2 Labex MS2T - Laboratoire d'Excellence "Maîtrise des Systèmes de Systèmes Technologiques"

We consider the flow shop problem with two machines and time delays with respect to the makespan, i.e., the maximum completion time. We recall the lower bounds of the literature and we propose new relaxation schemes. Moreover, we investigate a linear programming-based lower bound that includes the implementation of a new dominance rule and a valid inequality. A computational study that was carried out on a set of 480 instances including new hard ones shows that our new relaxation schemes outperform the state of the art lower bounds.

Domaines: Recherche opérationnelle [math.OC]

Mohamed Amine Mkadem, Aziz Moukrim, Mehdi Serairi. Lower Bounds for the Two-Machine Flow Shop Problem with Time Delays. Andreas Fink ; Armin Fügenschuh ; Martin Josef Geiger Operations Research Proceedings 2016, Springer International Publishing, pp.527-533, 2017, 978-3-319-55702-1. ⟨10.1007/978-3-319-55702-1_70⟩. ⟨hal-01551051⟩