P. Brucker, Scheduling Algorithms, 2001.

M. Bender, S. Chakrabarti, and S. Muthukrishnan, Flow and stretch metrics for scheduling continuous job streams, Proc. of SODA, pp.270-279, 1998.

E. L. Lawler, J. K. Lenstra, A. H. Kan, and D. B. Shmoys, Sequencing and scheduling: Algorithms and complexity, Handbooks in operations research and management science, pp.445-522, 1993.

E. Saule and D. V. Bozdag, Optimizing the stretch of independent tasks on a cluster: From sequential tasks to moldable tasks, Journal of Parallel and Distributed Computing, vol.72, issue.4, 2012.
DOI : 10.1016/j.jpdc.2011.12.007

A. Legrand, A. Su, and F. Vivien, Minimizing the stretch when scheduling flows of divisible requests, Journal of Scheduling, vol.3, issue.1, pp.381-404, 2008.
DOI : 10.1007/s10951-008-0078-4

URL : https://hal.archives-ouvertes.fr/hal-00789419

D. S. Hochbaum, Approximation Algorithms for NP-hard problems, 1997.

N. Bansal and K. Pruhs, norm, Proceedings of the thirty-fifth ACM symposium on Theory of computing , STOC '03, pp.242-250, 2003.
DOI : 10.1145/780542.780580

D. Golovin, A. Gupta, A. Kumar, and K. Tangwongsan, All-norms and all-Lp-norms approximation algorithms, Proc. of FSTTCS, pp.199-210, 2008.

S. Im and B. Moseley, -norms of Weighted Flow Time on Unrelated Machines, Proc. of ACM-SIAM SODA, pp.98-108, 2011.
DOI : 10.1137/1.9781611973082.8

URL : https://hal.archives-ouvertes.fr/hal-00907166

S. Anand, N. Garg, and A. Kumar, Resource Augmentation for Weighted Flow-time explained by Dual Fitting, Proc. of ACM-SIAM SODA, pp.1228-1241, 2012.
DOI : 10.1137/1.9781611973099.97

X. Lu, R. A. Sitters, and L. Stougie, A class of on-line scheduling algorithms to minimize total completion time, Operations Research Letters, vol.31, issue.3, pp.232-236, 2003.
DOI : 10.1016/S0167-6377(03)00016-6

N. Megow and A. S. Schulz, On-line scheduling to minimize average completion time revisited . Operation Research Letters, pp.485-490, 2003.