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

Research output: Contribution to journalArticlepeer-review

18 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 languageAmerican English
Pages (from-to)257-261
Number of pages5
JournalEuropean Journal of Operational Research
Volume157
Issue number1
DOIs
StatePublished - 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

Fingerprint

Dive into the research topics of 'Comments on "Flow shop and open shop scheduling with a critical machine and two operations per job"'. Together they form a unique fingerprint.

Cite this