Minimizing sum of completion times on a single machine with sequence-dependent family setup times
Karabatı, Selçuk and Akkan, Can (2006) Minimizing sum of completion times on a single machine with sequence-dependent family setup times. Journal of the operational research society, 57 (3). pp. 271-280. ISSN 0160-5682
Official URL: http://dx.doi.org/10.1057/palgrave.jors.2601989
This paper presents a branch-and-bound (B&B) algorithm for minimizing the sum of completion times in a singlemachine scheduling setting with sequence-dependent family setup times. The main feature of the B&B algorithm is a new lower bounding scheme that is based on a networkformulation of the problem. With extensive computational tests, we demonstrate that the B&B algorithm can solve problems with up to 60 jobs and 12 families, where setup and processing times are uniformly distributed in various combinations of the [1,50] and [1,100] ranges.
Repository Staff Only: item control page