V. Kats and E. Levner, Cyclic scheduling in a robotic production line, Journal of Scheduling, vol.2, issue.1, p.23, 2002.
DOI : 10.1137/0402049
URL : http://onlinelibrary.wiley.com/doi/10.1002/jos.92/pdf

G. Cavory, R. Dupas, and G. Goncalves, A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints, European Journal of Operational Research, vol.161, issue.1, p.73, 2005.
DOI : 10.1016/j.ejor.2003.03.001

H. Chen, C. Chu, and J. Proth, Cyclic scheduling of a hoist with time window constraints, IEEE Transactions on Robotics and Automation, vol.14, issue.1, p.144, 1998.
DOI : 10.1109/70.660860
URL : https://hal.archives-ouvertes.fr/inria-00074366

M. Ayala, A. Benabid, C. Artigues, and C. Hanen, The resource-constrained modulo scheduling problem: an experimental study, Computational Optimization and Applications, vol.81, issue.1, p.645, 2013.
DOI : 10.1023/A:1018917426360
URL : https://hal.archives-ouvertes.fr/hal-00568925

R. Govindarajan, E. R. Altman, and G. R. Gao, A framework for resource-constrained rate-optimal software pipelining, IEEE Transactions on Parallel and Distributed Systems, vol.7, issue.11, p.1133, 1996.
DOI : 10.1109/71.544355
URL : http://144.16.67.13/~govind/papers/TPDS-96.ps.gz

P. Brucker and T. Kampmeyer, A general model for cyclic machine scheduling problems, Discrete Applied Mathematics, vol.156, issue.13, p.2561, 2008.
DOI : 10.1016/j.dam.2008.03.029
URL : https://doi.org/10.1016/j.dam.2008.03.029

A. Che, J. Feng, H. Chen, and C. Chu, Robust optimization for the cyclic hoist scheduling problem, European Journal of Operational Research, vol.240, issue.3, p.627, 2015.
DOI : 10.1016/j.ejor.2014.06.047
URL : https://hal.archives-ouvertes.fr/hal-01273061

P. Chretienne, The basic cyclic scheduling problem with deadlines, Discrete Applied Mathematics, vol.30, issue.2-3, p.109, 1991.
DOI : 10.1016/0166-218X(91)90037-W
URL : https://doi.org/10.1016/0166-218x(91)90037-w

A. Munier, The basic cyclic scheduling problem with linear precedence constraints, Discrete Applied Mathematics, vol.64, issue.3, p.219, 1996.
DOI : 10.1016/0166-218X(94)00126-X
URL : https://doi.org/10.1016/0166-218x(94)00126-x

A. Ben-tal, A. Goryashko, E. Guslitzer, and A. Nemirovski, Adjustable robust solutions of uncertain linear programs, Mathematical Programming, vol.99, issue.2, p.351, 2004.
DOI : 10.1007/s10107-003-0454-y

D. Bertsimas and M. Sim, The Price of Robustness, Operations Research, vol.52, issue.1, p.35, 2004.
DOI : 10.1287/opre.1030.0065

M. Minoux, On 2-stage robust LP with RHS uncertainty: complexity results and applications, Journal of Global Optimization, vol.3, issue.4, p.521, 2011.
DOI : 10.1016/0377-2217(79)90227-3

A. Dasdan, Experimental analysis of the fastest optimum cycle ratio and mean algorithms, ACM Transactions on Design Automation of Electronic Systems, vol.9, issue.4, p.385, 2004.
DOI : 10.1145/1027084.1027085

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

V. Gabrel, M. Lacroix, C. Murat, and N. Remli, Robust location transportation problems under uncertain demands, Discrete Applied Mathematics, vol.164, p.100, 2014.
DOI : 10.1016/j.dam.2011.09.015
URL : https://hal.archives-ouvertes.fr/hal-01495347

B. V. Cherkassky and A. V. Goldberg, Negative-cycle detection algorithms, Mathematical Programming, vol.85, issue.2, p.277, 1999.
DOI : 10.1007/s101070050058
URL : http://www.avglab.com/andrew/./pub/neci-tr-96-029.ps

A. Dasdan, S. Irani, and R. K. Gupta, An experimental study of minimum mean cycle algorithms, 1998.