The purpose of this paper is to study the latest schedule existence, calculation and properties of a basic cyclic scheduling problem with deadlines. First it is shown that, in the general case, a latest schedule exists but may be difficult to compute. Then we focus on a special case we call the optimal cyclic production problem. We derive an upper bound for the number of maximal-path values needed to compute the latest starting times and show the K-periodic structure of the latest starting time sequences. © 1991.
Chretienne, P. (1991). The basic cyclic scheduling problem with deadlines. Discrete Applied Mathematics, 30(2–3), 109–123. https://doi.org/10.1016/0166-218X(91)90037-W