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.
|Titolo:||An improved branch-and-bound algorithm for the two machine total completion time flow shop problem|
|Data di pubblicazione:||2002|
|Digital Object Identifier (DOI):||10.1016/S0377-2217(01)00374-5|
|Appare nelle tipologie:||1.1 Articolo in rivista|