A. Allahverdi, The third comprehensive survey on scheduling problems with setup times/costs, European Journal of Operational Research, vol.246, issue.2, pp.345-378, 2015.

A. Allahverdi, J. N. Gupta, and T. Aldowaisan, A review of scheduling research involving setup considerations, Omega, vol.27, issue.2, pp.219-239, 1999.

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

N. Bansal, A. Srinivasan, and O. Svensson, Lift-and-round to improve weighted completion time on unrelated machines, Proceedings of the 48th Annual ACM Symposium on Theory of Computing, pp.156-167, 2016.

H. Feng, V. Misra, and D. Rubenstein, Optimal state-free, size-aware dispatching for heterogeneous M/G/-type systems, Performance Evaluation, vol.62, issue.1, pp.475-492, 2005.

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

R. Graham, E. Lawler, J. Lenstra, and A. Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, Discrete Optimization II, vol.5, pp.287-326, 1979.

M. Harchol-balter, Performance Modeling and Design of Computer Systems: Queueing Theory in Action, 2013.

M. Harchol-balter, M. E. Crovella, and C. D. Murta, On choosing a task assignment policy for a distributed server system, IEEE Journal of Parallel and Distributed Computing, vol.59, issue.2, pp.204-228, 1999.

K. Hiraishi, E. Levner, and M. Vlach, Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs, Computers and Operations Research, vol.29, issue.7, pp.841-848, 2002.

T. Kawaguchi and S. Kyan, Worst case bound of an LRF schedule for the mean weighted flow-time problem, SIAM Journal on Computing, vol.15, issue.4, pp.1119-1129, 1986.

E. L. Lawler, Sequencing jobs to minimize total weighted completion time subject to precedence constraints, Annals of Discrete Mathematics, vol.2, p.7590, 1978.

M. Queyranne and A. S. Schulz, Approximation bounds for a general class of precedence constrained parallel machine scheduling problems, SIAM Journal on Computing, vol.35, issue.5, pp.1241-1253, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00360197

H. Räcke, C. Sohler, and M. Westermann, Online scheduling for sorting buffers, Proceedings of 10th Annual European Symposium on Algorithms, pp.820-832, 2002.

A. S. Schulz and M. Skutella, The power of ?-points in preemptive single machine scheduling, Journal of Scheduling, vol.5, issue.2, pp.121-133, 2002.

A. S. Schulz and M. Skutella, Scheduling unrelated machines by randomized rounding, SIAM Journal on Discrete Mathematics, vol.15, issue.4, pp.450-469, 2002.

U. Schwiegelshohn, An alternative proof of the Kawaguchi-Kyan bound for the Largest-Ratio-First rule, Operations Research Letters, vol.39, issue.4, pp.255-259, 2011.

M. Skutella, Convex quadratic and semidefinite programming relaxations in scheduling, Journal of the ACM, vol.48, pp.206-242, 2001.

M. Skutella and G. J. Woeginger, A PTAS for minimizing the total weighted completion time on identical parallel machines, Mathematics of Operations Research, vol.25, issue.1, pp.63-75, 2000.