An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
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.
branch-and-bound flow shop scheduling lagrangean relaxation