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, pp.67-74, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01545599

D. Bertsimas and M. Sim, The price of robustness, Operations Research, vol.52, pp.35-53, 2004.

E. Boros, K. Borys, M. Khaled, V. Elbassioni, G. Gurvich et al., Inapproximability bounds for shortest-path network interdiction problems, 2005.

D. Gianlorenzo, G. D. Angelo, A. Stefano, C. Navarra, and . Pinotti, Recoverable robust timetables: An algorithmic approach on trees, IEEE Transactions on Computers, vol.60, pp.433-446, 2011.

V. Gabrel, C. Murat, and A. C. Thiele, Recent advances in robust optimization: An overview, European Journal of Operational Research, vol.235, pp.471-483, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01495346

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

W. Herroelen and R. Leus, Project scheduling under uncertainty: Survey and research potentials, European Journal of Operational Research, vol.165, pp.289-306, 2002.

W. Herroelen and R. Leus, The construction of stable project baseline schedules, European Journal of Operational Research, vol.156, issue.3, pp.550-565, 2004.

E. Israeli and R. Wood, Shortest-path network interdiction, Networks, vol.40, issue.2, pp.97-111, 2002.

R. Kolisch and A. Sprecher, PSPLIB -a project scheduling problem library, European Journal of Operational Research, vol.96, pp.205-216, 1996.

C. Liebchen, M. Lübbecke, R. Möhring, and S. Stiller, The concept of recoverable robustness, linear programming recovery, and railway applications. Robust and Online LargeScale Optimization, vol.5868, pp.1-27, 2009.

M. Minoux, Models and algorithms for robust PERT scheduling with time-dependent task durations, Vietnam Journal of Mathematics, vol.35, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01170398

M. Minoux and . Duality, Robustness, and 2-stage robust LP decision models. Application to Robust PERT Scheduling, Annales du LAMSADE N, vol.7, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00180529

A. Alves-pessoa, L. D. Puglia-pugliese, F. Guerriero, and M. Poss, Robust constrained shortest path problems under budgeted uncertainty, Networks, vol.66, issue.2, pp.98-111, 2015.

A. Schrijver and ;. A. Soyster, Technical note -convex programming with set-inclusive constraints and applications to inexact linear programming, Operations Research, vol.21, issue.5, pp.1154-1157, 1973.

J. Valdes, R. Tarjan, and E. Lawler, The recognition of series parallel digraphs, SIAM Journal on Computing, vol.11, issue.2, pp.298-313, 1982.