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

A. Basu-roy, M. Bougeret, N. Goldberg, and M. Poss, Approximating robust bin-packing with budgeted uncertainty, Algorithms and Data Structures Symposium (WADS) 2019, 2019.

D. Bertsimas and M. Sim, Robust discrete optimization and network flows, Math. Program, 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.

M. Bougeret, A. A. Pessoa, and M. Poss, Robust scheduling with budgeted uncertainty, Discrete Applied Mathematics, vol.261, pp.93-107, 2019.
URL : https://hal.archives-ouvertes.fr/lirmm-02020566

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.

K. Jansen, K. Klein, and J. Verschae, Closing the gap for makespan scheduling via sparsification techniques, 43rd International Colloquium on Automata, Languages, and Programming, vol.72, pp.1-72, 2016.

K. Jansen and M. Maack, An eptas for scheduling on unrelated machines of few different types, Workshop on Algorithms and Data Structures, pp.497-508, 2017.

A. Kasperski, A. Kurpisz, and P. Zielinski, Approximating a two-machine flow shop scheduling under discrete scenario uncertainty, European Journal of Operational Research, vol.217, issue.1, pp.36-43, 2012.

A. Kasperski, A. Kurpisz, and P. Zielinski, Parallel machine scheduling under uncertainty, Advances in Computational Intelligence -14th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2012, pp.74-83, 2012.

J. K. Lenstra, D. B. Shmoys, and E. Tardos, Approximation algorithms for scheduling unrelated parallel machines. Mathematical programming, vol.46, pp.259-271, 1990.

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.

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