Department of Business Administration2024-11-0920040377-221710.1016/S0377-2217(03)00415-62-s2.0-3042773342http://dx.doi.org/10.1016/S0377-2217(03)00415-6https://hdl.handle.net/20.500.14288/11213This 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.ManagementOperations researchManagement scienceJournal Article1872-6860222980400011Q110835