P. F. Dutot and D. Trystram, Scheduling on hierarchical clusters using malleable tasks, Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '01, pp.199-208, 2001.
DOI : 10.1145/378580.378640
URL : https://hal.archives-ouvertes.fr/inria-00001082

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

R. Lepere, D. Trystram, and G. Woeginger, Approximation algorithms for scheduling malleable tasks under precedence constraints, 9th Annual European Symposium on Algorithms -ESA 2001. Number 2161, pp.146-157, 2001.

H. Zhang, Approximation Algorithms for Min-Max Resource Sharing and Malleable Tasks Scheduling, 2004.

M. Skutella, Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem, Mathematics of Operations Research, vol.23, issue.4, pp.909-929, 1998.
DOI : 10.1287/moor.23.4.909

P. F. Dutot, Hierarchical scheduling for moldable tasks ? extended version, Laboratory ID-IMAG, 2005.
DOI : 10.1007/11549468_35
URL : https://hal.inria.fr/inria-00001077/file/d_eurext05.pdf