Batch scheduling of identical jobs on parallel identical machines

Baruch Mor, Gur Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

We study the classical batch scheduling problem with identical job processing times and identical setups on parallel identical machines. We show that, similar to the single machine case, the solution is given by a closed form, consisting of identical decreasing arithmetic sequences of batch sizes on the different machines. A very close-to-optimal integer solution is obtained in O(m+n) time, where m is the number of machines, and n is the number of jobs.

Original languageAmerican English
Pages (from-to)762-766
Number of pages5
JournalInformation Processing Letters
Volume112
Issue number20
DOIs
StatePublished - 31 Oct 2012

Bibliographical note

Funding Information:
The second author is the Charles Rosen Professor of Management, The School of Business Administration, The Hebrew University. This paper was supported in part by the Recanati Fund of the School of Business Administration, The Hebrew University, Jerusalem, Israel.

Keywords

  • Batch scheduling
  • Flowtime
  • Parallel identical machines
  • Scheduling
  • Setup times

Fingerprint

Dive into the research topics of 'Batch scheduling of identical jobs on parallel identical machines'. Together they form a unique fingerprint.

Cite this