A. Allahverdi, C. Ng, T. Cheng, and M. Kovalyov, A survey of scheduling problems with setup times or costs, European Journal of Operational Research, vol.187, issue.3, pp.985-1032, 2008.
DOI : 10.1016/j.ejor.2006.06.060

A. Asadpour, U. Feige, and A. Saberi, Santa claus meets hypergraph matchings, ACM Transactions on Algorithms, vol.8, issue.3, pp.1-249, 2012.
DOI : 10.1145/2229163.2229168
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.3137

N. Bansal and M. Sviridenko, The Santa Claus problem, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing , STOC '06, pp.31-40, 2006.
DOI : 10.1145/1132516.1132522

B. Chen, Y. Ye, and J. Zhang, Lot-sizing scheduling with batch setup times, Journal of Scheduling, vol.103, issue.1???3, pp.299-310, 2006.
DOI : 10.1007/s10951-006-8265-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.6888

J. R. Correa, V. Verdugo, and J. Verschae, Approximation algorithms for scheduling splitting jobs with setup times (2013) Talk in MAPSP

T. Ebenlendr, M. Kr?ál, and J. Sgall, Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines, Algorithmica, vol.143, issue.1, 1007.
DOI : 10.1007/s00453-012-9668-9

U. Feige, A threshold of ln n for approximating set cover, Journal of the ACM, vol.45, issue.4, pp.634-652, 1998.
DOI : 10.1145/285055.285059

U. Feige, On allocations that maximize fairness, pp.287-293, 2008.

R. Graham, E. Lawler, J. Lenstra, and A. Kan, Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Ann. Discrete Math, vol.5, pp.287-326, 1979.
DOI : 10.1016/S0167-5060(08)70356-X

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

B. Haeupler, B. Saha, and A. Srinivasan, New Constructive Aspects of the Lov??sz Local Lemma, Journal of the ACM, vol.58, issue.6, pp.1-28, 2011.
DOI : 10.1145/2049697.2049702

O. H. Ibarra and C. E. Kim, Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems, Journal of the ACM, vol.22, issue.4, pp.463-468, 1975.
DOI : 10.1145/321906.321909

D. W. Kim, D. G. Na, and F. Frank-chen, Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective, Robotics and Computer-Integrated Manufacturing, vol.19, issue.1-2, pp.173-181, 2003.
DOI : 10.1016/S0736-5845(02)00077-7

J. K. Lenstra, D. B. Shmoys, and E. Tardos, Approximation algorithms for scheduling unrelated parallel machines, Mathematical Programming, vol.23, issue.1-3, pp.259-271, 1990.
DOI : 10.1007/BF01585745
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.708

Z. Liu and T. C. Cheng, Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties, Journal of Scheduling, vol.7, issue.4, pp.313-327, 2004.
DOI : 10.1023/B:JOSH.0000031424.35504.c4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.509.3602

L. Lovász and A. Schrijver, Cones of Matrices and Set-Functions and 0???1 Optimization, SIAM Journal on Optimization, vol.1, issue.2, pp.166-190, 1991.
DOI : 10.1137/0801013

L. Polacek and O. Svensson, Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation, pp.726-737, 2012.
DOI : 10.1007/978-3-642-31594-7_61
URL : http://arxiv.org/abs/1205.1373

C. N. Potts and L. N. Wassenhove, Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity, Journal of the Operational Research Society, vol.43, issue.5, pp.395-406, 1992.
DOI : 10.1057/jors.1992.66

F. Schalekamp, R. Sitters, S. Van-der-ster, L. Stougie, V. Verdugo et al., Split scheduling with uniform setup times, Journal of Scheduling, vol.103, issue.1???3, pp.1-11, 2014.
DOI : 10.1007/s10951-014-0370-4
URL : https://hal.archives-ouvertes.fr/hal-01249095

A. Schrijver, Theory of Linear and Integer Programming, 1986.

P. Schuurman and G. J. Woeginger, Preemptive scheduling with job-dependent setup times, pp.759-767, 1999.

P. Serafini, Scheduling Jobs on Several Machines with the Job Splitting Property, Operations Research, vol.44, issue.4, pp.617-628, 1996.
DOI : 10.1287/opre.44.4.617

A. Shapiro, Semi-infinite programming, duality, discretization and optimality conditions???, Optimization, vol.91, issue.2, pp.133-161, 2009.
DOI : 10.1214/aoms/1177700153
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.2108

O. Svensson, Santa Claus Schedules Jobs on Unrelated Machines, SIAM Journal on Computing, vol.41, issue.5, pp.1318-1341, 2012.
DOI : 10.1137/110851201
URL : http://arxiv.org/abs/1011.1168

M. Sviridenko and A. Wiese, Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines, pp.387-398, 2013.
DOI : 10.1007/978-3-642-36694-9_33

S. Van-der-ster, The allocation of scarce resources in disaster relief, 2010.

J. Verschae and A. Wiese, On the configuration-LP for scheduling on unrelated machines, pp.530-542, 2011.

D. P. Williamson and D. B. Shmoys, The Design of Approximation Algorithms, 2011.
DOI : 10.1017/CBO9780511921735

W. Xing and J. Zhang, Parallel machine scheduling with splitting jobs, Discrete Applied Mathematics, vol.103, issue.1-3, pp.259-269, 2000.
DOI : 10.1016/S0166-218X(00)00176-1
URL : http://doi.org/10.1016/s0166-218x(00)00176-1