Open-shop batch scheduling with identical jobs

Gur Mosheiov*, Daniel Oron

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

32 Scopus citations

Abstract

This paper addresses batch scheduling problems on an m-machine open-shop. The objectives are minimum makespan and minimum flowtime. We assume identical processing time jobs, machine- and sequence-independent setup times and batch availability. The minimum makespan problem is shown to be solved in constant time. Specifically, we show that the optimal number of batches is either m or ⌈⌉ fenced(frac(n, ⌊ n / m ⌋)) (where m and n are the number of machines and the number of jobs, respectively). The complexity of the minimum flowtime problem is unknown. We propose an O(n) time algorithm which extends the solution of the single-machine case, and produces close-to-optimal solutions.

Original languageAmerican English
Pages (from-to)1282-1292
Number of pages11
JournalEuropean Journal of Operational Research
Volume187
Issue number3
DOIs
StatePublished - 16 Jun 2008

Bibliographical note

Funding Information:
This paper was supported in part by the Recanati Fund of the School of Business Administration, The Hebrew University, Jerusalem, Israel. We wish to thank three anonymous referees for their helpful comments.

Keywords

  • Batch scheduling
  • Flowtime
  • Makespan
  • Open-shop

Fingerprint

Dive into the research topics of 'Open-shop batch scheduling with identical jobs'. Together they form a unique fingerprint.

Cite this