D. Feitelson, Scheduling parallel jobs on clusters, High Performance Cluster Computing, pp.519-533

M. Drozdowski, Scheduling Parallel Tasks?Algorithms and Complexity, chapter 25 Handbook of SCHEDUL- ING Algorithms, Models and Performance Analysis, 2004.

P. Dutot, G. Mounié, and D. Trystram, Handbook of Scheduling, chapter Scheduling Parallel Tasks- Approximation Algorithms, 2004.

J. Blazewicz, M. Kovalyov, M. Machowiak, D. Trystram, and J. Weglarz, Preemptable malleable task scheduling problem, IEEE Transactions on Computers, vol.55, issue.4, pp.486-490, 2006.
DOI : 10.1109/TC.2006.58

A. B. Downey, TCP self-clocking and bandwidth sharing, Computer Networks, vol.51, issue.13, pp.3844-3863, 2007.
DOI : 10.1016/j.comnet.2007.04.005
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.559.3510

D. Abendroth, H. Van-den, M. Berg, and . Mandjes, A versatile model for TCP bandwidth sharing in networks with heterogeneous users, AEU - International Journal of Electronics and Communications, vol.60, issue.4, pp.267-278, 2006.
DOI : 10.1016/j.aeue.2005.03.009

Y. Zhu, A. Velayutham, O. Oladeji, and R. Sivakumar, Enhancing TCP for networks with guaranteed bandwidth services, Computer Networks, vol.51, issue.10, pp.2788-2804, 2007.
DOI : 10.1016/j.comnet.2006.11.026

O. Beaumont and H. Rejeb, On the importance of bandwidth control mechanisms for scheduling on large scale heterogeneous platforms, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS), pp.1-12, 2010.
DOI : 10.1109/IPDPS.2010.5470450
URL : https://hal.archives-ouvertes.fr/inria-00444585

M. Drozdowski, New applications of the Muntz and Coffman algorithm, Journal of Scheduling, vol.90, issue.4, pp.209-223, 2001.
DOI : 10.1002/jos.76

R. Sadykov, On scheduling malleable jobs to minimise the total weighted completion time, Proceedings of the 13th IFAC Symposium on Information Control Problems in Manufacturing, pp.1497-1499, 2009.
DOI : 10.3182/20090603-3-RU-2001.0183
URL : https://hal.archives-ouvertes.fr/inria-00339646

R. Motwani, S. Phillips, and E. Torng, Nonclairvoyant scheduling, Theoretical Computer Science, vol.130, issue.1, pp.17-47, 1994.
DOI : 10.1016/0304-3975(94)90151-1
URL : http://doi.org/10.1016/0304-3975(94)90151-1

X. Deng, N. Gu, T. Brecht, and K. Lu, Preemptive Scheduling of Parallel Jobs on Multiprocessors, SIAM Journal on Computing, vol.30, issue.1, pp.145-160, 2000.
DOI : 10.1137/S0097539797315598

J. Kim and K. Chwa, Non-clairvoyant scheduling for weighted flow time, Information Processing Letters, vol.87, issue.1, pp.31-37, 2003.
DOI : 10.1016/S0020-0190(03)00231-X

W. E. Smith, Various optimizers for single-stage production, Naval Research Logistics Quarterly, vol.2, issue.1-2, pp.59-66, 1956.
DOI : 10.1002/nav.3800030106

R. Mcnaughton, Scheduling with Deadlines and Loss Functions, Management Science, vol.6, issue.1, pp.1-12, 1959.
DOI : 10.1287/mnsc.6.1.1

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, p.1119, 1986.
DOI : 10.1137/0215081

U. Schwiegelshohn, An alternative proof of the Kawaguchi???Kyan bound for the Largest-Ratio-First rule, Operations Research Letters, vol.39, issue.4, 2011.
DOI : 10.1016/j.orl.2011.06.007

D. Chen, J. Wu, and P. Liu, Data-bandwidth-aware Job Scheduling in Grid and Cluster Environments, 2009 15th International Conference on Parallel and Distributed Systems, pp.414-421, 2009.
DOI : 10.1109/ICPADS.2009.42