The Browne-Yechiali single-machine sequence is optimal for flow-shops

Gur Mosheiov*, Assaf Sarig, Jeffrey Sidney

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


An optimal polynomial time solution for minimum makespan on a single machine with linear job deterioration is known in the scheduling literature for about 20 years (Browne and Yechiali, 1990 [1]). An extension of this result to flow-shop settings has not been published since then. In this note we provide this result: we show that the Browne-Yechiali sequence remains optimal for flow-shops, i.e. we present a polynomial time (O (n log n)) solution for minimum makespan on an m-machine flow-shop with linear job deterioration.

Original languageAmerican English
Pages (from-to)1965-1967
Number of pages3
JournalComputers and Operations Research
Issue number11
StatePublished - Nov 2010

Bibliographical note

Funding Information:
This work was supported in part by the Recanati fund of the School of Business, The Hebrew University, Jerusalem, and in part by the Natural Sciences and Engineering Research Council of Canada (NSERC) Grant number OGP0002507.


  • Flow-shop
  • Linear deterioration
  • Makespan
  • Scheduling


Dive into the research topics of 'The Browne-Yechiali single-machine sequence is optimal for flow-shops'. Together they form a unique fingerprint.

Cite this