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

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...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of operational research Vol. 159; no. 2; pp. 420 - 429
Main Authors Akkan, Can, Karabatı, Selçuk
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.12.2004
Elsevier
Elsevier Sequoia S.A
SeriesEuropean 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
Online AccessGet full text

Cover

More Information
Summary: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 extensive computational tests, we demonstrate that the branch-and-bound algorithm can solve problems with up to 60 (45) jobs, where processing times are uniformly distributed in the [1,10] ([1,100]) range.
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(03)00415-6