Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
475774 | Computers & Operations Research | 2013 | 7 Pages |
Abstract
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∥∑CjF2∥∑Cj and F2∥∑TjF2∥∑Tj. Moreover, we illustrate its wide applicability and good performance on two additional problems: F2∥∑Cj and F2∥∑lnCj.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Mohamed Haouari, Mohamed Kharbeche,