F. Afrati, E. Bampis, A. V. Fishkin, K. Jansen, and C. Kenyon, Scheduling to Minimize the Average Completion Time of Dedicated Tasks, Lecture Notes in Computer Science, vol.1974, 2000.
DOI : 10.1007/3-540-44450-5_37

S. Chakrabarti, C. A. Phillips, A. S. Schulz, D. B. Shmoys, C. Stein et al., Improved scheduling algorithms for minsum criteria, Lecture Notes in Computer Science, pp.646-657, 1099.
DOI : 10.1007/3-540-61440-0_166

D. Culler, J. Singh, and A. Gupta, Parallel Computer Architecture -A Hardware ,Sofware approach, 1999.

J. Du and J. Leung, Complexity of Scheduling Parallel Task Systems, SIAM Journal on Discrete Mathematics, vol.2, issue.4, pp.473-487, 1989.
DOI : 10.1137/0402042

P. Dutot, L. Eyraud, G. Mounié, and D. Trystram, Bi-criteria algorithm for scheduling jobs on cluster platforms, Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures , SPAA '04, 2004.
DOI : 10.1145/1007912.1007932
URL : https://hal.archives-ouvertes.fr/hal-00001520

L. Hall, D. Shmoys, and J. Wein, Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms, Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, pp.142-151, 1996.
DOI : 10.1287/moor.22.3.513

L. A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein, Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms, Mathematics of Operations Research, vol.22, issue.3, pp.513-544, 1997.
DOI : 10.1287/moor.22.3.513

D. S. Hochbaum and D. B. Shmoys, Using dual approximation algorithms for scheduling problems theoretical and practical results, Journal of the ACM, vol.34, issue.1, pp.144-162, 1987.
DOI : 10.1145/7531.7535

R. Lepère, G. Mounié, D. Trystram, and B. Robi?, Parallel Computing, Fundamentals and Applications, chapter Malleable Tasks: An efficient model for solving actual parallel applications, pp.598-605, 1999.

G. Mounié, Ordonnancement efficace d'applicationparalì eles : les tâches malléables monotones, 2000.

U. Schwiegelshohn, W. Ludwig, J. Wolf, J. Turek, and P. Yu, Smart SMART Bounds for Weighted Response Time Scheduling, SIAM Journal on Computing, vol.28, issue.1, 1998.
DOI : 10.1137/S0097539795286831
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.7921

H. Shachnai and J. Turek, Multiresource malleable task scheduling to minimize response time, Information Processing Letters, vol.70, issue.1, pp.47-52, 1999.
DOI : 10.1016/S0020-0190(99)00030-7

D. B. Shmoys, J. Wein, and D. P. Williamson, Scheduling Parallel Machines On-Line, SIAM Journal on Computing, vol.24, issue.6, pp.1313-1331, 1995.
DOI : 10.1137/S0097539793248317

V. T. 'kindt and J. Billaut, Multicriteria Scheduling ? Theory, Models and Algorithms, 2002.
URL : https://hal.archives-ouvertes.fr/hal-01067335

J. Turek, J. Wolf, and P. Yu, Approximate algorithms scheduling parallelizable tasks, Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures , SPAA '92, pp.323-332, 1992.
DOI : 10.1145/140901.141909