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

Gur Mosheiov; Assaf Sarig; Vitaly A. Strusevich; Jonathan Mosheiff

doi:10.1016/j.ejor.2018.04.019

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

BA Business Department

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

40 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 language	English
Pages (from-to)	388-400
Number of pages	13
Journal	European Journal of Operational Research
Volume	271
Issue number	2
DOIs	https://doi.org/10.1016/j.ejor.2018.04.019
State	Published - 1 Dec 2018

Bibliographical note

Publisher Copyright:
© 2018 Elsevier B.V.

Keywords

Approximation algorithm
Flow shop
Machine maintenance start window
Open shop
Scheduling

Access to Document

10.1016/j.ejor.2018.04.019

Cite this

@article{2cdf03ec98b24230aa4663307e4485ae,

title = "Two-machine flow shop and open shop scheduling problems with a single maintenance window",

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

keywords = "Approximation algorithm, Flow shop, Machine maintenance start window, Open shop, Scheduling",

author = "Gur Mosheiov and Assaf Sarig and Strusevich, \{Vitaly A.\} and Jonathan Mosheiff",

note = "Publisher Copyright: {\textcopyright} 2018 Elsevier B.V.",

year = "2018",

month = dec,

day = "1",

doi = "10.1016/j.ejor.2018.04.019",

language = "אנגלית",

volume = "271",

pages = "388--400",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

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

AU - Mosheiov, Gur

AU - Sarig, Assaf

AU - Strusevich, Vitaly A.

AU - Mosheiff, Jonathan

PY - 2018/12/1

Y1 - 2018/12/1

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

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

KW - Approximation algorithm

KW - Flow shop

KW - Machine maintenance start window

KW - Open shop

KW - Scheduling

UR - https://www.scopus.com/pages/publications/85048500767

U2 - 10.1016/j.ejor.2018.04.019

DO - 10.1016/j.ejor.2018.04.019

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

AN - SCOPUS:85048500767

SN - 0377-2217

VL - 271

SP - 388

EP - 400

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 2

ER -

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

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this