Parallel machine scheduling with family setup times to minimize total flowtime
International Journal of Operations and Quantitative Management, cilt.8, sa.1, ss.47-56, 2002 (Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 8 Sayı: 1
- Basım Tarihi: 2002
- Dergi Adı: International Journal of Operations and Quantitative Management
- Derginin Tarandığı İndeksler: Scopus
- Sayfa Sayıları: ss.47-56
- Orta Doğu Teknik Üniversitesi Adresli: Evet
Özet
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.