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

Gur Mosheiov; Assaf Sarig; Jeffrey Sidney

doi:10.1016/j.cor.2010.01.006

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

Gur Mosheiov^*, Assaf Sarig, Jeffrey Sidney

^*Corresponding author for this work

Business Administration

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

Abstract

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 language	English
Pages (from-to)	1965-1967
Number of pages	3
Journal	Computers and Operations Research
Volume	37
Issue number	11
DOIs	https://doi.org/10.1016/j.cor.2010.01.006
State	Published - 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.

Keywords

Flow-shop
Linear deterioration
Makespan
Scheduling

Access to Document

10.1016/j.cor.2010.01.006

Cite this

@article{5fc869f5b6714614bbe174241c6d1669,

title = "The Browne-Yechiali single-machine sequence is optimal for flow-shops",

abstract = "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.",

keywords = "Flow-shop, Linear deterioration, Makespan, Scheduling",

author = "Gur Mosheiov and Assaf Sarig and Jeffrey Sidney",

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.",

year = "2010",

month = nov,

doi = "10.1016/j.cor.2010.01.006",

language = "אנגלית",

volume = "37",

pages = "1965--1967",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd.",

number = "11",

}

TY - JOUR

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

AU - Mosheiov, Gur

AU - Sarig, Assaf

AU - Sidney, Jeffrey

N1 - 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.

PY - 2010/11

Y1 - 2010/11

N2 - 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.

AB - 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.

KW - Flow-shop

KW - Linear deterioration

KW - Makespan

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=77951115566&partnerID=8YFLogxK

U2 - 10.1016/j.cor.2010.01.006

DO - 10.1016/j.cor.2010.01.006

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:77951115566

SN - 0305-0548

VL - 37

SP - 1965

EP - 1967

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 11

ER -

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

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this