An assignment-based lower bound for a class of two-machine flow shop problems

Authors:
Mohamed Haouari;Mohamed Kharbeche
Affiliations:
Department of Mechanical and Industrial Engineering, College of Engineering, Qatar University, Qatar;Department of Mechanical and Industrial Engineering, College of Engineering, Qatar University, Qatar
Venue:
Computers and Operations Research
Year:
2013

Citing 6
Cited 0

A shortest augmenting path algorithm for dense and sparse linear assignment problems

Computing
The two-machine flowshop scheduling problem with total tardiness

Computers and Operations Research
A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops

Computers and Operations Research
Minimizing tardiness in a two-machine flow-shop

Computers and Operations Research
Lower bounds for minimizing total completion time in a two-machine flow shop

Journal of Scheduling
Note on minimizing total tardiness in a two-machine flowshop

Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)

Quantified Score

Hi-index	0.01

Visualization

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@?@?C"j and F2@?@?T"j. Moreover, we illustrate its wide applicability and good performance on two additional problems: F2@?@?C"j and F2@?@?lnC"j.