Complexity of cyclic scheduling problems: A state-of-the-art survey

Eugene Levner; Vladimir Kats; David Alcaide López De Pablo; T. C.E. Cheng

doi:10.1016/j.cie.2010.03.013

Complexity of cyclic scheduling problems: A state-of-the-art survey

Eugene Levner, Vladimir Kats, David Alcaide López De Pablo, T. C.E. Cheng

Research output: Contribution to journal › Short survey › peer-review

156 Scopus citations

Abstract

In this survey we review the current complexity status of basic cyclic scheduling models. We start with the formulations of three fundamental cyclic scheduling problems, namely the cyclic jobshop, cyclic flowshop, and cyclic project scheduling problems. We present state-of-the-art results on the computational complexity of the problems, paying special attention to recent results on the unsolvability (NP-hardness) of various cyclic problems arising from the scheduling of robotic cells.

Original language	English
Pages (from-to)	352-361
Number of pages	10
Journal	Computers and Industrial Engineering
Volume	59
Issue number	2
DOIs	https://doi.org/10.1016/j.cie.2010.03.013
State	Published - Sep 2010
Externally published	Yes

Bibliographical note

Funding Information:
We thank an anonymous referee for his/her constructive comments on an earlier version of our paper. Cheng was supported in part by the Hong Kong Polytechnic University under Grant No. G-U720 . Alcaide López de Pablo was supported in part by Spanish Government Research Projects MTM2007-60928 and MTM2009-08830, also helped by European Funds for Regional Development.

Funding

We thank an anonymous referee for his/her constructive comments on an earlier version of our paper. Cheng was supported in part by the Hong Kong Polytechnic University under Grant No. G-U720 . Alcaide López de Pablo was supported in part by Spanish Government Research Projects MTM2007-60928 and MTM2009-08830, also helped by European Funds for Regional Development.

Funders	Funder number
Spanish Government Research Projects	MTM2007-60928, MTM2009-08830
Hong Kong Polytechnic University	G-U720

Keywords

Complexity
Cyclic scheduling problems
Reducibility
Robotic scheduling

Access to Document

10.1016/j.cie.2010.03.013

Cite this

@article{683363b8b03b4906ac7d6d3d618ad441,

title = "Complexity of cyclic scheduling problems: A state-of-the-art survey",

abstract = "In this survey we review the current complexity status of basic cyclic scheduling models. We start with the formulations of three fundamental cyclic scheduling problems, namely the cyclic jobshop, cyclic flowshop, and cyclic project scheduling problems. We present state-of-the-art results on the computational complexity of the problems, paying special attention to recent results on the unsolvability (NP-hardness) of various cyclic problems arising from the scheduling of robotic cells.",

keywords = "Complexity, Cyclic scheduling problems, Reducibility, Robotic scheduling",

author = "Eugene Levner and Vladimir Kats and {Alcaide L{\'o}pez De Pablo}, David and Cheng, {T. C.E.}",

note = "Funding Information: We thank an anonymous referee for his/her constructive comments on an earlier version of our paper. Cheng was supported in part by the Hong Kong Polytechnic University under Grant No. G-U720 . Alcaide L{\'o}pez de Pablo was supported in part by Spanish Government Research Projects MTM2007-60928 and MTM2009-08830, also helped by European Funds for Regional Development.",

year = "2010",

month = sep,

doi = "10.1016/j.cie.2010.03.013",

language = "אנגלית",

volume = "59",

pages = "352--361",

journal = "Computers and Industrial Engineering",

issn = "0360-8352",

publisher = "Elsevier Ltd.",

number = "2",

}

TY - JOUR

T1 - Complexity of cyclic scheduling problems

T2 - A state-of-the-art survey

AU - Levner, Eugene

AU - Kats, Vladimir

AU - Alcaide López De Pablo, David

AU - Cheng, T. C.E.

N1 - Funding Information: We thank an anonymous referee for his/her constructive comments on an earlier version of our paper. Cheng was supported in part by the Hong Kong Polytechnic University under Grant No. G-U720 . Alcaide López de Pablo was supported in part by Spanish Government Research Projects MTM2007-60928 and MTM2009-08830, also helped by European Funds for Regional Development.

PY - 2010/9

Y1 - 2010/9

N2 - In this survey we review the current complexity status of basic cyclic scheduling models. We start with the formulations of three fundamental cyclic scheduling problems, namely the cyclic jobshop, cyclic flowshop, and cyclic project scheduling problems. We present state-of-the-art results on the computational complexity of the problems, paying special attention to recent results on the unsolvability (NP-hardness) of various cyclic problems arising from the scheduling of robotic cells.

AB - In this survey we review the current complexity status of basic cyclic scheduling models. We start with the formulations of three fundamental cyclic scheduling problems, namely the cyclic jobshop, cyclic flowshop, and cyclic project scheduling problems. We present state-of-the-art results on the computational complexity of the problems, paying special attention to recent results on the unsolvability (NP-hardness) of various cyclic problems arising from the scheduling of robotic cells.

KW - Complexity

KW - Cyclic scheduling problems

KW - Reducibility

KW - Robotic scheduling

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

U2 - 10.1016/j.cie.2010.03.013

DO - 10.1016/j.cie.2010.03.013

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.shortsurvey???

AN - SCOPUS:77955700913

SN - 0360-8352

VL - 59

SP - 352

EP - 361

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

IS - 2

ER -

Complexity of cyclic scheduling problems: A state-of-the-art survey

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this