A note: Minimizing maximum earliness on a proportionate flowshop

Baruch Mor, Gur Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

9 Scopus citations


Most classical scheduling objective functions have been studied in the context of a proportionate flowshop. In most cases, the solution was shown to be identical to that of the single machine version. In this note we introduce a rare case where the extension to a proportionate flowshop leads to a different solution. Specifically, we study the problem of minimizing maximum earliness. We show that the problem remains polynomially solvable, but the running time of our proposed greedy-type algorithm is larger than that of the single machine case.

Original languageAmerican English
Pages (from-to)253-255
Number of pages3
JournalInformation Processing Letters
Issue number2
StatePublished - Feb 2015

Bibliographical note

Publisher Copyright:
© 2014 Elsevier B.V. All rights reserved.


  • Minmax earliness
  • Proportionate flowshop
  • Scheduling


Dive into the research topics of 'A note: Minimizing maximum earliness on a proportionate flowshop'. Together they form a unique fingerprint.

Cite this