A. Agra, M. Christiansen, R. Figueiredo, L. M. Hvattum, M. Poss et al., The robust vehicle routing problem with time windows, Computers & OR, vol.40, issue.3, pp.856-866, 2013.
DOI : 10.1016/j.cor.2012.10.002
URL : https://hal.archives-ouvertes.fr/hal-00916976

M. A. Aloulou and F. D. Croce, Complexity of single machine scheduling problems under scenario-based uncertainty, Operations Research Letters, vol.36, issue.3, pp.338-342, 2008.
DOI : 10.1016/j.orl.2007.11.005
URL : https://hal.archives-ouvertes.fr/hal-00115501

A. Ben-tal and A. Nemirovski, Robust solutions of uncertain linear programs, Oper. Res. Lett, vol.25, issue.1, pp.1-13, 1999.
DOI : 10.1016/s0167-6377(99)00016-4

D. Bertsimas and M. Sim, Robust discrete optimization and network flows, Math. Program, vol.98, issue.1-3, pp.49-71, 2003.
DOI : 10.1007/s10107-003-0396-4

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

P. Brucker, Scheduling algorithms, vol.3, 2007.

R. L. Daniels and P. Kouvelis, Robust scheduling to hedge against processing time uncertainty in single-stage production, Management Science, vol.41, issue.2, pp.363-376, 1995.
DOI : 10.1287/mnsc.41.2.363

B. T. Denton, A. J. Miller, H. J. Balasubramanian, and T. R. Huschka, Optimal allocation of surgery blocks to operating rooms under uncertainty, Operations research, vol.58, issue.4, pp.802-816, 2010.
DOI : 10.1287/opre.1090.0791
URL : https://hal.archives-ouvertes.fr/hal-00386469

K. Goetzmann, S. Stiller, and C. Telha, Optimization over integers with robustness in cost and few constraints, Approximation and Online Algorithms -9th International Workshop, WAOA 2011, pp.89-101, 2011.

R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. R. Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals of discrete mathematics, vol.5, pp.287-326, 1979.

M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, 1988.

E. Horowitz and S. Sahni, Exact and approximate algorithms for scheduling nonidentical processors, J. ACM, vol.23, issue.2, pp.317-327, 1976.
DOI : 10.1145/321941.321951

L. G. Khachiyan, Polynomial algorithms in linear programming, USSR Computational Mathematics and Mathematical Physics, vol.20, issue.1, pp.53-72, 1980.
DOI : 10.1016/0041-5553(80)90061-0

O. Klopfenstein and D. Nace, A robust approach to the chance-constrained knapsack problem, Oper. Res. Lett, vol.36, issue.5, pp.628-632, 2008.
DOI : 10.1016/j.orl.2008.03.006
URL : http://www.optimization-online.org/DB_FILE/2006/03/1341.pdf

O. Koné, C. Artigues, P. Lopez, and M. Mongeau, Event-based MILP models for resource-constrained project scheduling problems, Computers & OR, vol.38, issue.1, pp.3-13, 2011.

P. Kouvelis and G. Yu, Robust discrete optimization and its applications, vol.14, 1997.

J. Lenstra, D. Shmoys, and E. Tardos, Approximation algorithms for scheduling unrelated parallel machines, Mathematical Programming, vol.46, issue.1-3, 1990.
DOI : 10.1109/sfcs.1987.8
URL : https://ir.cwi.nl/pub/18055/18055A.pdf

J. K. Lenstra, A. R. Kan, and P. Brucker, Complexity of machine scheduling problems, Annals of discrete mathematics, vol.1, pp.343-362, 1977.
DOI : 10.1016/s0167-5060(08)70743-x
URL : https://ir.cwi.nl/pub/18051/18051A.pdf

M. Mastrolilli, N. Mutsanas, and O. Svensson, Approximating single machine scheduling with scenarios, Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, pp.153-164, 2008.
DOI : 10.1007/978-3-540-85363-3_13
URL : http://www.nada.kth.se/~osven/papers/scenarios.pdf

W. Naji, M. Espinouse, and V. Cung, Towards a robust scheduling on unrelated parallel machines: A scenarios based approach, Modelling, Computation and Optimization in Information Systems and Management Sciences, vol.360, pp.343-355, 2015.
DOI : 10.1007/978-3-319-18167-7_30
URL : https://hal.archives-ouvertes.fr/hal-01692262

A. A. Pessoa, L. D. Pugliese, F. Guerriero, and M. Poss, Robust constrained shortest path problems under budgeted uncertainty, Networks, vol.66, issue.2, pp.98-111, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01229790

M. L. Pinedo, Scheduling: Theory, Algorithms, and Systems, 2008.

M. Poss, Robust combinatorial optimization with variable budgeted uncertainty, vol.4, pp.75-92, 2013.
DOI : 10.1007/s10288-012-0217-9
URL : https://hal.archives-ouvertes.fr/hal-00916975

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

W. E. Smith, Various optimizers for single-stage production, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.59-66, 1956.

B. Tadayon and J. C. Smith, Algorithms and complexity analysis for robust singlemachine scheduling problems, J. Scheduling, vol.18, issue.6, pp.575-592, 2015.

J. Yang and G. Yu, On the robust single machine scheduling problem, Journal of Combinatorial Optimization, vol.6, issue.1, pp.17-33, 2002.