Parallel machine scheduling with family setup times to minimize total flowtime

Azizoğlu M., Çaǧici T., Kondakci S.

International Journal of Operations and Quantitative Management, vol.8, no.1, pp.47-56, 2002 (Scopus) identifier


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.