The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm

• Published in: European journal of operational research Vol. 159; no. 2; pp. 420 - 429
• Main Authors: Akkan, Can, Karabatı, Selçuk
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 01.12.2004; Elsevier; Elsevier Sequoia S.A
• Series: European Journal of Operational Research
• Subjects: Algorithms; Branch & bound algorithms; Branch-and-bound; Flowshop scheduling; Job shops; Lagrange multiplier; Lagrangean relaxation; Scheduling; Studies; Lagrangean relaxation; Branch-and-bound; Flowshop scheduling

This paper presents a branch-and-bound algorithm for the two-machine flowshop scheduling problem with the objective of minimizing the sum of completion times. The main feature of the branch-and-bound algorithm is a new lower bounding scheme that is based on a network formulation of the problem. With...