An assignment-based lower bound for a class of two-machine flow shop problems.
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 outperforms state-of-the-art lower bounds in two important special cases: F2 parallel to Sigma C-j and F2 parallel to Sigma T-j. Moreover, we illustrate its wide applicability and good performance on two additional problems: F2 parallel to Sigma root C-j and F2 parallel to Sigma ln C-j. (C) 2013 Elsevier Ltd. All rights reserved.
flow shop linear assignment total completion times total tardiness