Scheduling a batch processing machine with incompatible job families

Azizoglu M., Webster S.

COMPUTERS & INDUSTRIAL ENGINEERING, cilt.39, ss.325-335, 2001 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 39
  • Basım Tarihi: 2001
  • Doi Numarası: 10.1016/s0360-8352(01)00009-2
  • Dergi Adı: COMPUTERS & INDUSTRIAL ENGINEERING
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.325-335
  • Anahtar Kelimeler: scheduling, batch processor, TOTAL COMPLETION-TIME, SIZES
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

The problem of scheduling batch processors is important in some industries and, at a more fundamental level, captures an element of complexity common to many practical scheduling problems. We describe a branch and bound procedure applicable to a batch processor model with incompatible job families. Jobs in a given family have identical job processing times, arbitrary job weights, and arbitrary job sizes. Batches are limited to jobs from the same family. The scheduling objective is to minimize total weighted completion time. We find that the procedure returns optimal solutions to problems of up to about 25 jobs in reasonable CPU time, and can be adapted for use as a heuristic for larger problems. (C) 2001 Elsevier Science Ltd. All rights reserved.