Batch scheduling on uniform machines to minimize total flow-time

Baruch Mor, Gur Mosheiov

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


The solution of the classical batch scheduling problem with identical jobs and setup times to minimize flowtime is known for twenty five years. In this paper we extend this result to a setting of two uniform machines with machine-dependent setup times. We introduce an O(n) solution for the relaxed version (allowing non-integer batch sizes), followed by a simple rounding procedure to obtain integer batch sizes.

Original languageEnglish
Pages (from-to)571-575
Number of pages5
JournalComputers and Operations Research
Issue number3
StatePublished - Mar 2012
Externally publishedYes


  • Batch scheduling
  • Flowtime
  • Uniform machines


Dive into the research topics of 'Batch scheduling on uniform machines to minimize total flow-time'. Together they form a unique fingerprint.

Cite this