Parallel machine scheduling with family setup times to minimize total flowtime

2002-12-01
Azizoğlu, Meral
Çaǧici, Tunga
Kondakci, Suna
In this study, we consider parallel machine scheduling problem with family setup times. Our criterion is to minimize total flowtime. We develop a branch and bound algorithm using an efficient branching scheme and powerful lower and upper bounds. Our computational experiment has shown that the algorithm finds optimal solutions to moderate-sized problems in reasonable CPU times.
Citation Formats
M. Azizoğlu, T. Çaǧici, and S. Kondakci, “Parallel machine scheduling with family setup times to minimize total flowtime,” pp. 47–56, 2002, Accessed: 00, 2021. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84874251961&origin=inward.