. Brucker, . Kampmeyer, P. Brucker, and T. Kampmeyer, A general model for cyclic machine scheduling problems, Discrete Applied Mathematics, vol.156, issue.13, pp.2561-2572, 2008.
DOI : 10.1016/j.dam.2008.03.029

. Bueler, Exact Volume Computation for Polytopes: A Practical Study, Polytopes | Combinatorics and Computation, p.29, 2000.
DOI : 10.1007/978-3-0348-8438-9_6

. Fink, A New Procedure for the Cyclic Job Shop Problem, Proceedings of INCOM 2012, 2012.
DOI : 10.3182/20120523-3-RO-2023.00172

C. Hanen, Study of a NP-hard cyclic scheduling problem: The recurrent job-shop, European Journal of Operational Research, vol.72, issue.1, pp.82-101, 1994.
DOI : 10.1016/0377-2217(94)90332-8

M. Hanen, C. Hanen, and A. Munier, Scheduling Theory and Its Applications , chapter Cyclic Scheduling on Parallel Processors: An Overview, 1995.

M. Hanen, C. Hanen, and A. Munier, A study of the cyclic scheduling problem on parallel processors, Discrete Applied Mathematics, vol.57, issue.2-3, pp.167-192, 1995.
DOI : 10.1016/0166-218X(94)00102-J

P. Hillion, H. P. Hillion, and J. M. Proth, Performance evaluation of job-shop systems using timed event-graphs, IEEE Transactions on Automatic Control, vol.34, issue.1, pp.3-9, 1989.
DOI : 10.1109/9.8644

D. B. Johnson, Finding All the Elementary Circuits of a Directed Graph, SIAM Journal on Computing, vol.4, issue.1, pp.77-84, 1975.
DOI : 10.1137/0204007

. Kats, . Levner, V. Kats, and E. Levner, A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling, Operations Research Letters, vol.21, issue.4, pp.171-179, 1997.
DOI : 10.1016/S0167-6377(97)00036-9

M. Pinedo, Planning and Scheduling in Manufacturing and Services, 2005.
DOI : 10.1007/978-1-4419-0910-7

R. Tarjan, Enumeration of the Elementary Circuits of a Directed Graph, SIAM Journal on Computing, vol.2, issue.3, pp.211-216, 1973.
DOI : 10.1137/0202017