Two-machine flow shop and open shop scheduling problems with a single maintenance window

Gur Mosheiov, Assaf Sarig, Vitaly A. Strusevich*, Jonathan Mosheiff

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

29 Scopus citations

Abstract

The paper considers the two-machine flow shop and open shop scheduling problems to minimize the makespan, provided that one of the machines is subject to maintenance, which has to start within a prescribed time window. In the case of the flow shop, maintenance is performed on the second machine. A non-resumable setting is considered, i.e., if a job cannot be completed prior to the maintenance, it must restart from scratch after the maintenance. For each of these NP-hard problems we develop a 3/2–approximation algorithm.

Original languageAmerican English
Pages (from-to)388-400
Number of pages13
JournalEuropean Journal of Operational Research
Volume271
Issue number2
DOIs
StatePublished - 1 Dec 2018

Bibliographical note

Publisher Copyright:
© 2018 Elsevier B.V.

Keywords

  • Approximation algorithm
  • Flow shop
  • Machine maintenance start window
  • Open shop
  • Scheduling

Fingerprint

Dive into the research topics of 'Two-machine flow shop and open shop scheduling problems with a single maintenance window'. Together they form a unique fingerprint.

Cite this