A single machine batch scheduling problem with bounded batch size

Gur Mosheiov*, Daniel Oron

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

30 Scopus citations

Abstract

We address a single-machine batch scheduling problem to minimize total flow time. Processing times are assumed to be identical for all jobs. Setup times are assumed to be identical for all batches. As in many practical situations, batch sizes may be bounded. In the first setting studied in this paper, all batch sizes cannot exceed a common upper bound. In the second setting, all batch sizes share a common lower bound. An optimal solution consists of the number of batches and their (integer) size. We introduce an efficient solution for both problems.

Original languageAmerican English
Pages (from-to)1069-1079
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 two anonymous referees for their helpful comments.

Keywords

  • Deterministic batch scheduling
  • Flow-time
  • Single machine

Fingerprint

Dive into the research topics of 'A single machine batch scheduling problem with bounded batch size'. Together they form a unique fingerprint.

Cite this