Kharbeche, M; Haouari, M - In: Journal of the Operational Research Society 64 (2013) 5, pp. 690-707
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...