Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/24750
Title: Complexity of cyclic scheduling problems : a state-of-the-art survey
Authors: Levner, E
Kats, V
Lopez de Pablo, AD
Cheng, TCE 
Keywords: Complexity
Cyclic scheduling problems
Reducibility
Robotic scheduling
Issue Date: 2010
Publisher: Pergamon Press
Source: Computers and industrial engineering, 2010, v. 59, no. 2, p. 352-361 How to cite?
Journal: Computers and industrial engineering 
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.
URI: http://hdl.handle.net/10397/24750
ISSN: 0360-8352
EISSN: 1879-0550
DOI: 10.1016/j.cie.2010.03.013
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

88
Last Week
1
Last month
2
Citations as of Aug 21, 2017

WEB OF SCIENCETM
Citations

70
Last Week
0
Last month
0
Citations as of Aug 20, 2017

Page view(s)

66
Last Week
1
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.