. .. Approches-de-résolution,

. .. Expérimentations-numériques, , p.115

. .. Conclusion, K. Ravindra, and . Ahuja, Network flows : Theory, algorithms, and applications. Pearson Education, 1st édition, 2017.

H. Aissi, C. Bazgan, and D. Vanderpooten, Min-max and min-max regret versions of combinatorial optimization problems : A survey, European journal of operational research, vol.197, issue.2, p.28, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00158652

, Minimizing the weighted sum of completion times under processing time uncertainty, Thi Sang Nguyen et Michael Poss, vol.64, p.39, 2017.

, Roel Leus et Fabrice Talla Nobibon. Robust optimization for resource-constrained project scheduling with uncertain activity durations, Flexible Services and Manufacturing Journal, vol.25, issue.1, p.39, 2013.

, Alper Atamturk et Muhong Zhang. Two-stage robust network flow and design under demand uncertainty, Operations Research, vol.55, issue.4, p.36, 2007.

M. Ayala and A. Benabid, Christian Artigues et Claire Hanen. The resource-constrained modulo scheduling problem : an experimental study, Computational Optimization and Applications, vol.54, issue.3, p.24, 2013.

J. Ayoub and M. Poss, Decomposition for adjustable robust linear optimization subject to uncertainty polytope, Computational Management Science, vol.13, issue.2, pp.219-239, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01301374

A. Azzouz, Meriem Ennigrou et Lamjed Ben Said. A hybrid algorithm for flexible job-shop scheduling problem with setup times, International Journal of Production Management and Engineering, vol.5, issue.1, 2017.

N. Balouka and I. Cohen, A Robust Optimization Model for the Multi-mode Resource Constrained Project Scheduling Problem with Uncertain Activity Durations, International Conference on Project Management and Scheduling (PMS), p.39, 2018.

J. M. Barman, C. Martinez, and S. Verma, Max-plus to solve the cyclic job shop problem with time lags, 5th International Conference on Control, Decision and Information Technologies (CoDIT), p.12, 2018.

. Bibliographie-;-richard-bellman, On a routing problem, Quarterly of applied mathematics, vol.16, issue.1, pp.87-90, 1958.

A. Ben-hmida, M. Haouari, M. Huguet, and P. Lopez, Discrepancy Search for the Flexible Job Shop Scheduling Problem, Computers and Operations Research, vol.37, issue.12, pp.2192-2201
URL : https://hal.archives-ouvertes.fr/hal-00461981

A. Ben-tal and A. Nemirovski, Robust solutions of uncertain linear programs, Operations Research Letters, vol.25, issue.1, pp.1-13, 1999.

A. Ben-tal and A. Nemirovski, Robust solutions of linear programming problems contaminated with uncertain data, Mathematical programming, vol.88, issue.3, pp.411-424, 2000.

A. Ben-tal and A. Nemirovski, Robust solutions of Linear Programming problems contaminated with uncertain data, Mathematical Programming, vol.88, issue.3, pp.411-424, 2000.

, Aharon Ben-Tal et Arkadi Nemirovski. Robust optimizationmethodology and applications. Mathematical Programming, vol.92, issue.3, p.27, 2002.

A. Ben-tal, A. Goryashko, E. Guslitzer, and A. Nemirovski, Adjustable robust solutions of uncertain linear programs, Mathematical Programming, vol.99, issue.2, pp.351-376, 2004.

, Robust optimization, vol.28, 2009.

A. Benabid-najjar, C. Hanen, O. Marchetti, and A. Munier-kordon, Periodic schedules for bounded timed weighted event graphs, IEEE Transactions on Automatic Control, vol.57, issue.5, p.12, 2012.

A. Benabid and C. Hanen, Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays, Journal of Scheduling, vol.14, issue.5, pp.511-522, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01185245

A. Benabid and C. Hanen, Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays, Journal of Scheduling, vol.14, issue.5, p.24, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01185245

P. Bendotti, P. Chrétienne, P. Fouilhoux, and A. Quilliot, Anchored reactive and proactive solutions to the CPM-scheduling problem, European Journal of Operational Research, vol.261, issue.1, pp.67-74, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01545599

D. Bertsimas and M. Sim, Robust discrete optimization and network flows, Mathematical programming, vol.98, issue.1-3, pp.49-71, 2003.

D. Bertsimas and M. Sim, The Price of Robustness, Operations Research, vol.52, issue.1, pp.35-53, 2004.

D. Bertsimas, B. David, and . Brown, Constructing uncertainty sets for robust linear optimization, Operations research, vol.57, issue.6, p.28, 2009.

D. Bertsimas and V. Goyal, On the power of robust solutions in two-stage stochastic and adaptive optimization problems, Mathematics of Operations Research, vol.35, issue.2, p.37, 2010.

, Vineet Goyal et Xu Andy Sun. A geometric characterization of the power of finite adaptability in multistage stochastic and adaptive optimization, Mathematics of Operations Research, vol.36, issue.1, p.37, 2011.

D. Andrei-iancu, A. Pablo, and . Parrilo, A hierarchy of near-optimal policies for multistage adaptive optimization, IEEE Transactions on Automatic Control, vol.56, issue.12, p.37, 2011.

, Dimitris Bertsimas et Vineet Goyal. On the power and limitations of affine policies in two-stage adaptive optimization. Mathematical programming, vol.134, p.37, 2012.

D. Bertsimas and V. Goyal, On the approximability of adjustable robust convex optimization under uncertainty, Mathematical Methods of Operations Research, vol.77, issue.3, p.37, 2013.

, On the performance of affine policies for two-stage adaptive optimization : a geometric perspective, Bertsimas 2015a] Dimitris Bertsimas et Hoda Bidkhori, vol.153, p.37, 2015.

V. Goyal, Y. Brian, and . Lu, A tight characterization of the performance of static solutions in two-stage adjustable robust linear optimization, Mathematical Programming, vol.150, issue.2, p.37, 2015.

, Iain Dunning et Miles Lubin. Reformulation versus cutting-planes for robust optimization, Computational Management Science, vol.13, issue.2, pp.195-217, 2016.

F. John-r-birge and . Louveaux, Introduction to stochastic programming, 2011.

A. Bonfietti and M. Lombardi, Luca Benini et Michela Milano. A constraint based approach to cyclic RCPSP, International Conference on Principles and Practice of Constraint Programming, p.24, 2011.

, Artur Alves Pessoa et Michael Poss. Robust scheduling with budgeted uncertainty, Discrete Applied Mathematics, p.39, 2018.

. Paul-c-bouman, . Van-den, . Akker, and . Hoogeveen, Recoverable robustness by column generation, European Symposium on Algorithms, p.36, 2011.

F. Boussemart, G. Cavory, and C. Lecoutre, Solving the cyclic job shop scheduling problem with linear precedence constraints using CP techniques, IEEE International Conference on, vol.7, p.23, 2002.

R. A. Bowman and J. A. Muckstadt, Stochastic Analysis of Cyclic Schedules, Operations Research, vol.41, issue.5, pp.947-958, 1993.

W. Bo?ejko, J. Pempera, and M. Wodecki, Parallel Simulated Annealing Algorithm for Cyclic Flexible Job Shop Scheduling Problem, p.110, 2015.

W. Bo?ejko, M. Uchro?ski, and M. Wodecki, Block approach to the cyclic flow shop scheduling, Computers & Industrial Engineering, vol.81, p.24, 2015.

P. Brucker and R. Schlie, Job-shop scheduling with multi-purpose machines. Computing, vol.45, pp.369-375, 1990.

P. Brucker and T. Kampmeyer, Cyclic job shop scheduling problems with blocking, Annals of Operations Research, vol.159, issue.1, pp.161-181, 2008.

P. Brucker, K. Edmund, S. Burke, and . Groenemeyer, A branch and bound algorithm for the cyclic job-shop problem with transportation, Computers & Operations Research, vol.39, issue.12, p.24, 2012.

P. Brucker, K. Edmund, S. Burke, and . Groenemeyer, A mixed integer programming model for the cyclic job-shop problem with transportation, Discrete applied mathematics, vol.160, issue.13-14, p.24, 1924.

M. E. Bruni, L. Di-puglia-pugliese, P. Beraldi, and F. Guerriero, An adjustable robust optimization model for the resource-constrained project scheduling problem with uncertain activity durations, Omega, vol.71, p.39, 2017.

M. E. Bruni, L. Di-puglia-pugliese, P. Beraldi, and F. Guerriero, A computational study of exact approaches for the adjustable robust resourceconstrained project scheduling problem, Computers& Operations Research, vol.99, p.39, 2018.

C. Buchheim and J. Kurtz, Robust combinatorial optimization under convex and discrete cost uncertainty, vol.34, 2017.

B. Büeler, Andreas Enge et Komei Fukuda. Exact volume computation for polytopes : A practical study, vol.101, pp.131-154, 2000.

, Benno Büeler et Andreas Enge. VINCI version 1.0. 5, Computing volumes of convex polytopes. Laboratoire d'Informatique École polytechnique, vol.91128, p.105, 2003.

C. Büsing, S. Kirchner, and A. Thome, The Capacitated Budgeted Minimum Cost Flow Problem with Unit Upgrading Costs, 14th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW16). (Cité en, vol.55, p.49, 2016.

R. Research, , vol.12, p.18, 1978.

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.23, 2005.

F. Chauvet, W. Jeffrey, J. Herrmann, and . Proth, Optimization of cyclic production systems : a heuristic approach, IEEE Transactions on Robotics and Automation, vol.19, issue.1, p.19, 2003.

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, pp.627-636, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01273061

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, pp.144-152, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00074366

H. Chen, J. Ihlow, and C. Lehmann, A genetic algorithm for flexible jobshop scheduling, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C), vol.2, p.110, 1999.

V. Boris, A. V. Cherkassky, and . Goldberg, Negative-cycle detection algorithms, Mathematical Programming, vol.85, issue.2, pp.277-311, 1999.

P. Chrétienne, Chemins extrémaux d'un graphe doublement valué, RAIRO, Rech. Opér, vol.18, p.15, 1984.

P. Chretienne, The basic cyclic scheduling problem with deadlines, Discrete Applied Mathematics, vol.30, issue.2, pp.109-123, 1991.

J. Clausen, Branch and bound algorithms-principles and examples, p.73, 1999.

J. Cochet-terrasson, G. Cohen, S. Gaubert, M. Mcgettrick, and J. Quadrat, Numerical computation of spectral elements in max-plus algebra, Proc. IFAC Conf. on Syst. Structure and Control, 1998.

D. Cordeiro, G. Mounié, S. Perarnau, D. Trystram, J. Vincent et al., Random graph generation for scheduling simulations, Proceedings of the 3rd international ICST conference on simulation tools and techniques, vol.60, p.64, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00471255

. Raymond-a-cuninghame-green, Describing industrial processes with interference and approximating their steady-state behaviour, Journal of the Operational Research Society, vol.13, issue.1, p.12, 1962.

B. George and . Dantzig, Linear programming under uncertainty, Stochastic programming, p.27, 2010.

A. Dasdan, . Irani, K. Rajesh, and . Gupta, An experimental study of minimum mean cycle algorithms. Rapport technique, 1998.

A. Dasdan, S. Sandy, . Irani, K. Rajesh, and . Gupta, Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems, Design Automation Conference, p.15, 1999.

A. Dasdan, Experimental analysis of the fastest optimum cycle ratio and mean algorithms, ACM Transactions on Design Automation of Electronic Systems (TODAES), vol.9, issue.4, pp.385-418, 2004.

H. N. Milind-dawande, . Geismar, P. Suresh, C. Sethi, and . Sriskandarajah, Sequencing and Scheduling in Robotic Cells : Recent Developments, Journal of Scheduling, vol.8, issue.5, pp.387-426, 2005.

, Converging to periodic schedules for cyclic scheduling problems with resources and deadlines, Computers & Operations Research, vol.51, pp.227-236, 2014.

L. Ghaoui and H. Lebret, Robust Solutions to Least-Squares Problems with Uncertain Data, SIAM Journal on Matrix Analysis and Applications, vol.18, issue.4, pp.1035-1064, 1997.

L. E. Ghaoui, F. Oustry, and H. Lebret, Robust Solutions to Uncertain Semidefinite Programs, SIAM Journal on Optimization, vol.9, issue.1, pp.33-52, 1998.

M. Fink, T. Ben-rahhou, and L. Houssin, A new procedure for the cyclic job shop problem, IFAC Proceedings Volumes, vol.45, pp.69-74, 2012.

W. Robert and . Floyd, Algorithm 97 : shortest path, Communications of the ACM, vol.5, issue.6, p.345, 1962.

. Lester-r-ford, Network flow theory. Rapport technique, vol.54, 1956.

A. Franco-gasperoni and U. Schwiegelshohn, Generating close to optimum loop schedules on parallel processors, Parallel Processing Letters, vol.04, issue.04, pp.391-403, 1994.

G. Mazyar-ghadiri-nejad and . Kovács, Béla Vizvári et Reza Vatankhah Barenji. An optimization model for cyclic scheduling problem in flexible robotic cells, The International Journal of Advanced Manufacturing Technology, vol.95, issue.9, pp.3863-3873, 2018.

V. Andrew, T. Goldberg, and . Radzik, A heuristic improvement of the Bellman-Ford algorithm, Applied Mathematics Letters, vol.6, issue.3, pp.3-6, 1993.

M. Gondran and M. Minoux, Graphes et algorithmes. Eyrolles, p.15, 1979.

C. Stephen, . Graves, C. Harlan, D. Meal, A. H. Stefek et al., Scheduling of re-entrant flow shops, Journal of Operations Management, vol.3, issue.4, p.24, 1983.

, 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.

;. Bibliographie and H. Claire, Journal of the operational research society, chapitre Cyclic scheduling on parallel processors : An overview, pp.194-226, 1997.

&. Taylor and O. Francis, , 1997.

C. Hanen and A. Munier-kordon, Periodic schedules for linear precedence constraints, Discrete Applied Mathematics, vol.157, issue.2, p.16, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01185124

, Zdenek Hanzalek, Claire Hanen et Premysl Sucha. Cyclic Scheduling-New Application and Concept of Core Precedences. eraerts, p.165, 2011.

Z. Hanzalek and C. Hanen, The impact of core precedences in a cyclic RCPSP with precedence delays, Journal of Scheduling, vol.18, issue.3, p.24, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01185106

W. Herroelen and . Leus, Project scheduling under uncertainty : Survey and research potentials, European journal of operational research, vol.165, issue.2, pp.289-306, 2005.

, Scheduling of Flexible Flow Shops I, 1979.

L. Houssin, Cyclic jobshop problem and (max,plus) algebra, World IFAC Congress (IFAC 2011), pp.2717-2721, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00667948

A. Ronald and . Howard, Dynamic programming and Markov processes, 1964.

T. Hsu, R. Dupas, and G. Goncalves, A genetic algorithm to solving the problem of flexible manufacturing system cyclic scheduling, IEEE International Conference on Systems, Man and Cybernetics, vol.3, 2002.

A. Dan, M. Iancu, M. Sharma, and . Sviridenko, Supermodularity and affine policies in dynamic robust optimization, Operations Research, vol.61, issue.4, p.37, 2013.

A. Jalilvand-nejad and P. Fattahi, A mathematical model and genetic algorithm to cyclic flexible job shop scheduling problem, vol.26, p.2013, 2013.

D. B. Johnson, Finding All the Elementary Circuits of a Directed Graph, SIAM Journal on Computing, vol.4, issue.1, p.97, 1975.

S. Karabati and B. Tan, Stochastic Cyclic Scheduling Problem in Synchronous Assembly and Production Lines, The Journal of the Operational Research Society, vol.49, issue.11, pp.1173-1187, 1998.

V. Kats and E. Levner, Cyclic scheduling in a robotic production line, Journal of Scheduling, vol.5, issue.1, pp.23-41, 2002.

V. Kats and E. Levner, Cyclic scheduling in a robotic production line, Journal of Scheduling, vol.5, issue.1, p.24, 2002.

M. Kechadi, K. Seng-low, and . Goncalves, Recurrent neural network approach for cyclic job shop scheduling problem, Journal of Manufacturing Systems, vol.32, issue.4, p.23, 2013.

M. Kechadi, K. Seng-low, and G. Goncalves, Recurrent neural network approach for cyclic job shop scheduling problem, Journal of Manufacturing Systems, vol.32, issue.4, pp.689-699, 2013.

E. James and . Kelley, The cutting-plane method for solving convex programs, Journal of the society for Industrial and Applied Mathematics, vol.8, issue.4, p.36, 1960.

, Robust discrete optimization and its applications, vol.14, p.28, 2013.

T. Lee, E. Marc, and . Posner, Performance measures and schedules in periodic job shops, Operations Research, vol.45, issue.1, pp.72-91, 1997.

T. Lee, Stable earliest starting schedules for cyclic job shops : a linear system approach, International Journal of Flexible Manufacturing Systems, vol.12, issue.1, p.23, 2000.

E. Levner, V. Kats, E. Vadim, and . Levit, An improved algorithm for cyclic flowshop scheduling in a robotic cell, European Journal of Operational Research, vol.97, issue.3, p.24, 1997.

E. Levner, V. Kats, and P. David-alcaide-lópez-de, Cyclic scheduling in robotic cells : an extension of basic models in machine scheduling theory, Multiprocessor scheduling, theory and applications, 2007.

E. Levner, V. Kats, D. A. López-de-pablo, and E. Cheng, Complexity of cyclic scheduling problems : A state-ofthe-art survey, Computers & Industrial Engineering, vol.59, issue.2, p.24, 2010.

C. Liebchen, Periodic timetable optimization in public transport, Operations Research Proceedings, pp.29-36, 2006.

M. Minoux, Robust linear programming with right-hand-side uncertainty, duality and applicationsrobust linear programming with righthand-side uncertainty, duality and applications, pp.3317-3327, 2009.

F. Edward and . Moore, The shortest path through a maze, Proc. Int. Symp. Switching Theory, vol.54, pp.285-292, 1959.

A. Munier, The complexity of a cyclic scheduling problem with identical machines and precedence constraints, European journal of operational research, vol.91, issue.3, p.24, 1996.

A. Munier, The basic cyclic scheduling problem with linear precedence constraints, Discrete applied mathematics, vol.64, issue.3, p.16, 1996.

, Houssem Eddine Nouri, Olfa Belkahla Driss et Khaled Ghédira. Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model, Journal of Industrial Engineering International, vol.14, issue.1, 2018.

M. Poss, Robust combinatorial optimization with variable cost uncertainty, European Journal of Operational Research, vol.237, issue.3, pp.836-845, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01099569

. Iv-romanovskil, Optimization of stationary control of a discrete deterministic process, Cybernetics, vol.3, issue.2, p.15, 1967.

A. Rossi, E. Gurevsky, O. Battaïa, and A. Dolgui, Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations, Discrete Applied Mathematics, vol.208, pp.123-136, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01301625

, Cyclic schedules for job shops with identical jobs, Mathematics of operations research, vol.17, issue.4, pp.842-865, 1992.

N. Sadeh, S. Otsuka, and R. Schnelbach, Predictive and reactive scheduling with the Micro-Boss production scheduling and control system, Dans Proceedings, IJCAI-93 Workshop on Knowledge-Based Production Planning, Scheduling and Control, vol.40, 1993.

M. C. Santos, M. Poss, and D. Nace, A perfect information lower bound for robust lot-sizing problems, Annals of Operations Research, p.36, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01409515

M. Singh and R. P. Judd, Efficient calculation of the makespan for job-shop systems without recirculation using max-plus algebra, International Journal of Production Research, vol.52, issue.19, p.12, 2014.

, Ju-Seog Song et Tae-Eog Lee. Petri net modeling and scheduling for cyclic job shops with blocking, Computers & Industrial Engineering, vol.34, issue.2, p.12, 1998.

, Ju-Seog Song et Tae-Eog Lee. Petri net modeling and scheduling for cyclic job shops with blocking, Computers & Industrial Engineering, vol.34, issue.2, p.24, 1998.

A. L. Soyster, Technical Note-Convex Programming with SetInclusive Constraints and Applications to Inexact Linear Programming, Operations Research, vol.21, issue.5, pp.1154-1157, 1973.

P. Sucha and Z. Hanzalek, Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times, Mathematical and Computer Modelling, vol.47, issue.9, pp.925-942, 2008.

R. Tarjan, Enumeration of the Elementary Circuits of a Directed Graph, SIAM Journal on Computing, vol.2, issue.3, p.97, 1973.

A. Thiele, T. Terry, and M. Epelman, , p.36, 2009.

, Adjustable Robust Optimization-A Survey and Tutorial. Available online at ResearchGate, Gorissen et Dick den Hertog, vol.35, 2017.

L. Yu, C. Zhu, J. Shi, and W. Zhang, An Extended Flexible Job Shop Scheduling Model for Flight Deck Scheduling with Priority, Parallel Operations, and Sequence Flexibility, Sci. Program, vol.2017, 2017.

H. Zhang, C. Stephen, and . Graves, Cyclic scheduling in a stochastic environment, Operations Research, vol.45, issue.6, pp.894-903, 1997.

, Hongchang Zhang, Simon Collart-Dutilleul et Khaled Mesghouni. Cyclic Scheduling of Flexible Job-shop with Time Window Constraints and Resource Capacity Constraints, vol.48, pp.816-821, 2015.