Search
Now showing items 1-2 of 2
MIP models for minimizing total tardiness in a two-machine flow shop
(
Palgrave Macmillan Ltd.
, 2013 , Article)
We propose compact mixed-integer programming models for the NP-hard problem of minimizing tardiness in a two-machine flow shop. Also, we propose valid inequalities that aim at tightening the models' representations. We ...
An assignment-based lower bound for a class of two-machine flow shop problems
(2013 , Article)
We present an assignment-based lower bound that is valid for a wide class of two-machine flow shop problems with a regular additive performance criterion. We provide empirical evidence that this new bound consistently ...