Scheduling a batch processing machine with incompatible job families

Meral Azizoglu, Scott Webster

Research output: Contribution to journalArticlepeer-review

77 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)325-335
Number of pages11
JournalComputers and Industrial Engineering
Volume39
Issue number3-4
DOIs
StatePublished - Apr 2001
Externally publishedYes

Keywords

  • Batch processor
  • Scheduling

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Fingerprint

Dive into the research topics of 'Scheduling a batch processing machine with incompatible job families'. Together they form a unique fingerprint.

Cite this