Scheduling a batch processing machine with non-identical job sizes

Meral Azizoglu, Scott Webster

Research output: Contribution to journalArticlepeer-review

48 Scopus citations


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 ∼ 25 jobs in reasonable CPU time, and can be adapted for use as a heuristic for larger problems.

Original languageEnglish (US)
Pages (from-to)2173-2184
Number of pages12
JournalInternational Journal of Production Research
Issue number10
StatePublished - Jun 10 2000
Externally publishedYes

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering


Dive into the research topics of 'Scheduling a batch processing machine with non-identical job sizes'. Together they form a unique fingerprint.

Cite this