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

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.