The equal allocation policy in open shop batch scheduling

B. Mor, G. Mosheiov*, D. Oron

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

We study the optimality of the very practical policy of equal allocation of jobs to batches in batch scheduling problems on an m-machine open shop. The objective is minimum makespan. We assume unit processing time jobs, machine-dependent setup times and batch availability. We show that equal allocation is optimal for a two-machine and a three-machine open shop. Although, this policy is not necessarily optimal for larger size open shops, it is shown numerically to produce very close-to-optimal schedules.

Original languageAmerican English
Pages (from-to)646-652
Number of pages7
JournalJournal of the Operational Research Society
Volume63
Issue number5
DOIs
StatePublished - May 2012

Keywords

  • batch scheduling
  • makespan
  • open shop

Fingerprint

Dive into the research topics of 'The equal allocation policy in open shop batch scheduling'. Together they form a unique fingerprint.

Cite this