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, pp.427-438, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00158652

´. Alvarez-miranda, E. Ljubic, I. Toth, and P. , A note on the bertsimas & sim algorithm for robust combinatorial optimization problems, 4OR, vol.11, issue.4, pp.349-360, 2013.

J. Balogh, J. Békési, G. Dósa, J. Sgall, and R. Van-stee, The optimal absolute ratio for online bin packing, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015.

J. Balogh, J. Békési, G. Dósa, L. Epstein, and A. Levin, A New and Improved Algorithm for Online Bin Packing, ESA. LIPIcs, vol.112, 2018.

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

M. Bougeret, A. A. Pessoa, and M. Poss, Robust scheduling with budgeted uncertainty, Discrete Applied Mathematics, 2018.
URL : https://hal.archives-ouvertes.fr/lirmm-02020566

F. Dexter, A. Macario, and R. D. Traub, Which algorithm for scheduling addon elective cases maximizes operating room utilization? use of bin packing algorithms and fuzzy constraints in operating room management, Anesthesiology, vol.91, pp.1491-1500, 1999.

K. Goetzmann, S. Stiller, and C. Telha, Optimization over integers with robustness in cost and few constraints, WAOA. pp, pp.89-101, 2011.

C. E. Gounaris, W. Wiesemann, and C. A. Floudas, The robust capacitated vehicle routing problem under demand uncertainty, Operations Research, vol.61, issue.3, pp.677-693, 2013.

D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham, Worst-case performance bounds for simple one-dimensional packing algorithms, SIAM Journal on Computing, vol.3, issue.4, pp.299-325, 1974.

N. Karmarkar and R. M. Karp, An efficient approximation scheme for the onedimensional bin-packing problem, Proc. 23rd Annual Symp. Foundations of Computer Science (sfcs 1982), pp.312-320, 1982.

A. Kasperski and P. Zieli´nskizieli´nski, On the approximability of minmax (regret) network optimization problems, Information Processing Letters, vol.109, issue.5, pp.262-266, 2009.

A. Kasperski and P. Zielinski, On the approximability of robust spanning tree problems, Theor. Comput. Sci, vol.412, issue.4-5, pp.365-374, 2011.

,

M. Poss, Robust combinatorial optimization with knapsack uncertainty, Discrete Optimization, vol.27, pp.88-102, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01444717

,

D. Simchi-levi, New worst-case results for the bin-packing problem 41, pp.579-585, 1994.

G. Song, D. Kowalczyk, and R. Leus, The robust machine availability problem-bin packing under uncertainty, IISE Trans. pp, pp.1-35, 2018.

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.