Comments on "Flow shop and open shop scheduling with a critical machine and two operations per job"

Gur Mosheiov; Uri Yovel

doi:10.1016/S0377-2217(03)00236-4

Comments on "Flow shop and open shop scheduling with a critical machine and two operations per job"

Gur Mosheiov^*, Uri Yovel

^*Corresponding author for this work

Business Administration

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

19 Scopus citations

Abstract

A recent paper [Eur. J. Operat. Res. 127 (2000) 120] addresses a flow-shop scheduling problem, where (i) each of the n jobs is limited to at most two operations, and (ii) one of these operations is common for all the jobs. The paper introduces a polynomial time solution algorithm for the problem, which appears to be surprisingly simple. Our short note contains several comments related to the correctness of the algorithm, to its complexity, to the proof of optimality and to a possible extension.

Original language	English
Pages (from-to)	257-261
Number of pages	5
Journal	European Journal of Operational Research
Volume	157
Issue number	1
DOIs	https://doi.org/10.1016/S0377-2217(03)00236-4
State	Published - 16 Aug 2004

Bibliographical note

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

Keywords

Flow-shop
Minimum makespan
Polynomial time algorithm
Scheduling

Access to Document

10.1016/S0377-2217(03)00236-4

Cite this

@article{48f8250522d94ca095932704a0dbbd33,

title = "Comments on {"}Flow shop and open shop scheduling with a critical machine and two operations per job{"}",

abstract = "A recent paper [Eur. J. Operat. Res. 127 (2000) 120] addresses a flow-shop scheduling problem, where (i) each of the n jobs is limited to at most two operations, and (ii) one of these operations is common for all the jobs. The paper introduces a polynomial time solution algorithm for the problem, which appears to be surprisingly simple. Our short note contains several comments related to the correctness of the algorithm, to its complexity, to the proof of optimality and to a possible extension.",

keywords = "Flow-shop, Minimum makespan, Polynomial time algorithm, Scheduling",

author = "Gur Mosheiov and Uri Yovel",

note = "Funding Information: This research was supported in part by the Recanati Fund of The School of Business Administration, The Hebrew University, Jerusalem.",

year = "2004",

month = aug,

day = "16",

doi = "10.1016/S0377-2217(03)00236-4",

language = "אנגלית",

volume = "157",

pages = "257--261",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Comments on "Flow shop and open shop scheduling with a critical machine and two operations per job"

AU - Mosheiov, Gur

AU - Yovel, Uri

N1 - Funding Information: This research was supported in part by the Recanati Fund of The School of Business Administration, The Hebrew University, Jerusalem.

PY - 2004/8/16

Y1 - 2004/8/16

N2 - A recent paper [Eur. J. Operat. Res. 127 (2000) 120] addresses a flow-shop scheduling problem, where (i) each of the n jobs is limited to at most two operations, and (ii) one of these operations is common for all the jobs. The paper introduces a polynomial time solution algorithm for the problem, which appears to be surprisingly simple. Our short note contains several comments related to the correctness of the algorithm, to its complexity, to the proof of optimality and to a possible extension.

AB - A recent paper [Eur. J. Operat. Res. 127 (2000) 120] addresses a flow-shop scheduling problem, where (i) each of the n jobs is limited to at most two operations, and (ii) one of these operations is common for all the jobs. The paper introduces a polynomial time solution algorithm for the problem, which appears to be surprisingly simple. Our short note contains several comments related to the correctness of the algorithm, to its complexity, to the proof of optimality and to a possible extension.

KW - Flow-shop

KW - Minimum makespan

KW - Polynomial time algorithm

KW - Scheduling

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

U2 - 10.1016/S0377-2217(03)00236-4

DO - 10.1016/S0377-2217(03)00236-4

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

AN - SCOPUS:1842478878

SN - 0377-2217

VL - 157

SP - 257

EP - 261

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 1

ER -

Comments on "Flow shop and open shop scheduling with a critical machine and two operations per job"

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this