Paper Info
Title
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
Abstract
We consider the two machine total completion time flow shop scheduling problem. This problem is known to be NP-Hard in the strong sense. An improved Lagrangean relaxation approach is proposed. Two new dominance criteria are introduced to curtail the enumeration tree. A branch-and-bound algorithm capable of solving to optimality medium size problem instances is presented.
Year
DOI
Venue
2002
10.1016/S0377-2217(01)00374-5
European Journal of Operational Research
Keywords
Field
DocType
Flow shop scheduling,Branch-and-bound,Lagrangean relaxation
Branch and bound,Mathematical optimization,Job shop scheduling,Enumeration,Flow shop scheduling,Mathematics
Journal
Volume
Issue
ISSN
139
2
0377-2217
Citations 
PageRank 
References 
25
3.12
0
Authors
3
Name
Order
Citations
PageRank
Federico Della Croce139941.60
Marco Ghirardi29310.14
Roberto Tadei366747.45