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
N1 - Publisher Copyright:
© 2018 Elsevier B.V.
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 - http://www.scopus.com/inward/record.url?scp=85048500767&partnerID=8YFLogxK
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 -