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

R. D. Blumofe and C. E. Leiserson, Scheduling multithreaded computations by work stealing, Proceedings: 35th Annual Symposium on Foundations of Computer Science, pp.356-368, 1994.
DOI : 10.1109/sfcs.1994.365680
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.7695

Y. Cheng and T. Robertazzi, Distributed computation for a tree network with communication delays, IEEE Transactions on Aerospace and Electronic Systems, vol.26, issue.3, pp.700-712, 1988.
DOI : 10.1109/7.106129

D. Culler, R. Karp, D. Patterson, A. Sahay, E. Santos et al., LogP: a practical model of parallel computation, Communications of the ACM, vol.39, issue.11, pp.78-85, 1996.
DOI : 10.1145/240455.240477

D. E. Culler, J. P. Singh, and A. Gupta, Parallel Computer Architecture: A Hardware/Software Approach, 1999.

P. Dutot, G. Mounié, and D. Trystram, Handbook of combinatorics , chapter 26

A. Gerasoulis and T. Yang, PYRROS: static scheduling and code generation for message passing multiprocessors, Proceedings of the 6th ACM International Conference on Supercomputing, pp.428-437, 1992.

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.3347

D. Hochbaum and D. 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.5753

J. Hwang, Y. Chow, F. Anger, and C. Lee, Scheduling Precedence Graphs in Systems with Interprocessor Communication Times, SIAM Journal on Computing, vol.18, issue.2, pp.244-257, 1989.
DOI : 10.1137/0218016

A. Lodi, S. Martello, and M. Monaci, Two-dimensional packing problems: A survey, European Journal of Operational Research, vol.141, issue.2, pp.241-252, 2002.
DOI : 10.1016/S0377-2217(02)00123-6

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

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. Shmoys, J. Wein, and D. Williamson, Scheduling Parallel Machines On-Line, SIAM Journal on Computing, vol.24, issue.6, pp.1313-1331, 1995.
DOI : 10.1137/S0097539793248317

D. Trystram and W. Zimmermann, On multi-broadcast and scheduling receive-graphs under logp with long messages, The Fourth International Workshop on Advanced Parallel Processing Technologies -APPT 01, pp.37-48, 2001.

M. Wu and D. Gajski, Hypertool: a programming aid for message-passing systems, IEEE Transactions on Parallel and Distributed Systems, vol.1, issue.3, pp.330-343, 1990.
DOI : 10.1109/71.80160