Minimizing flow-time on a single machine with integer batch sizes

Gur Mosheiov*, Daniel Oron, Yaacov Ritov

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

34 Scopus citations


We address a classical minimum flow-time, single-machine, batch-scheduling problem. Processing times and setups are assumed to be identical for all jobs and batches, respectively. Santos and Magazine (Oper. Res. Lett. 4(1985) 99) introduced an efficient solution for the relaxed (non-integer) problem. We introduce a simple rounding procedure for Santos and Magazine's solution, which guarantees optimal integer batches.

Original languageAmerican English
Pages (from-to)497-501
Number of pages5
JournalOperations Research Letters
Issue number5
StatePublished - Sep 2005

Bibliographical note

Funding Information:
This paper was supported in part by the Recanati Fund of The School of Business, The Hebrew University, Jerusalem, Israel.


  • Deterministic batch scheduling
  • Flow-time
  • Single machine


Dive into the research topics of 'Minimizing flow-time on a single machine with integer batch sizes'. Together they form a unique fingerprint.

Cite this