Scheduling a batch processing machine with non-identical job sizes


Azizoglu M. , Webster S.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, cilt.38, ss.2173-2184, 2000 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 38 Konu: 10
  • Basım Tarihi: 2000
  • Doi Numarası: 10.1080/00207540050028034
  • Dergi Adı: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
  • Sayfa Sayıları: ss.2173-2184

Ö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 arbitrary job processing times, job weights and job sizes. The scheduling objective is to minimize total weighted completion time. We find that the procedure returns optimal solutions to problems of up to similar to 25 jobs in reasonable CPU time, and can be adapted for use as a heuristic for larger problems.