Complexity of cyclic scheduling problems
โ
Eugene Levner; Vladimir Kats; David Alcaide Lรณpez de Pablo; T.C.E. Cheng
๐
Article
๐
2010
๐
Elsevier Science
๐
English
โ 325 KB
## a b s t r a c t 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-ar