Scheduling parallel machines to minimize weighted flowtime with family set-up times

Azizoglu, MERAL; Webster, S

doi:10.1080/0020754021000042959

Scheduling parallel machines to minimize weighted flowtime with family set-up times

Atıf İçin Kopyala

Azizoglu M., Webster S.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, cilt.41, sa.6, ss.1199-1215, 2003 (SCI-Expanded)

Yayın Türü: Makale / Tam Makale
Cilt numarası: 41 Sayı: 6
Basım Tarihi: 2003
Doi Numarası: 10.1080/0020754021000042959
Dergi Adı: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
Sayfa Sayıları: ss.1199-1215
Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

We describe and evaluate several branch-and-bound algorithms for an identical parallel machine scheduling problem with family set-up times and an objective of minimizing total weighted flowtime. The algorithms differ by choice of lower bound method. Computational results suggest conditions favourable to a particular algorithm as well as the range of problem sizes that can be optimally solved in reasonable CPU time.