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??Cj F 2 ? ? C j and F2??Tj F 2 ? ? T j . Moreover, we illustrate its wide applicability and good performance on two additional problems: F 2 ? ? C j and F 2 ? ? ln C j .
flow shop linear assignment total completion times total tardiness