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.
Bibliographical noteFunding 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.
- Cyclic scheduling problems
- Robotic scheduling