I. Ahmad and Y. Kwok, On exploiting task duplication in parallel program scheduling, IEEE Transactions on Parallel and Distributed Systems, vol.9, issue.9, pp.872-892, 1998.
DOI : 10.1109/71.722221

S. Ali, H. J. Siegel, M. Maheswaran, D. Hensgen, and S. Ali, Representing Task and Machine Heterogeneities for Heterogeneous Computing Systems, Tamkang Journal of Science and Engineering, vol.3, issue.3, pp.195-207, 2000.

A. Bhattacharyya, On a measure of divergence between two statistical populations defined by their probability distributions, Bull. Calcutta Math. Soc, vol.35, issue.4, pp.99-109, 1943.

M. John, M. B. Burt, and . Garman, Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis, Management Science, vol.18, issue.3, pp.207-217, 1971.

C. Louis, E. Canon, and . Jeannot, A Comparison of Robustness Metrics for Scheduling DAGs on Heterogeneous Systems, Heteropar'07, pp.568-567, 2007.

C. Louis, E. Canon, and . Jeannot, Scheduling Strategies for the Bicriteria Optimization of the Robustness and Makespan, 11th International Workshop on Nature Inspired Distributed Computing, 2008.

C. E. Clark, The Greatest of a Finite Set of Random Variables, Operations Research, vol.9, issue.2, pp.145-162, 1961.
DOI : 10.1287/opre.9.2.145

R. Cole and R. Hariharan, Dynamic LCA Queries on Trees, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, pp.235-244, 1999.
DOI : 10.1137/S0097539700370539

J. Díaz, J. Petit, and M. J. Serna, A survey of graph layout problems, ACM Computing Surveys, vol.34, issue.3, pp.313-356, 2002.
DOI : 10.1145/568522.568523

B. Dodin, Bounding the Project Completion Time Distribution in PERT Networks, Operations Research, vol.33, issue.4, pp.862-881, 1985.
DOI : 10.1287/opre.33.4.862

N. Harold and . Gabow, Data Structures for Weighted Matching and Nearest Common Ancestors with Linking, Proceedings of the first annual ACM- SIAM symposium on Discrete algorithms, pp.434-443, 1990.

J. N. Hagstrom, Computational complexity of PERT problems, Networks, vol.8, issue.2, pp.139-147, 1988.
DOI : 10.1002/net.3230180206

J. Kamburowski, Normally Distributed Activity Durations in PERT Networks, Journal of the Operational Research Society, vol.36, issue.11, pp.1051-11057, 1985.
DOI : 10.1057/jors.1985.184

G. B. Kleindorfer, Bounding Distributions for a Stochastic Acyclic Network, Operations Research, vol.19, issue.7, pp.1586-1601, 1971.
DOI : 10.1287/opre.19.7.1586

D. G. Malcolm, J. H. Roseboom, C. E. Clark, and W. Fazar, Application of a Technique for Research and Development Program Evaluation, Operations Research, vol.7, issue.5, pp.646-669, 1959.
DOI : 10.1287/opre.7.5.646

J. J. Martin, Distribution of the Time Through a Directed, Acyclic Network, Operations Research, vol.13, issue.1, pp.46-66, 1965.
DOI : 10.1287/opre.13.1.46

S. Sachin, H. Sapatnekar, and . Chang, Statistical Timing Analysis Considering Spatial Correlations using a Single Pert-Like Traversal, Computer Aided Design (ICCAD-2003), pp.621-625, 2003.

D. Sculli, The Completion Time of PERT Networks, Journal of the Operational Research Society, vol.34, issue.2, pp.155-158, 1983.
DOI : 10.1057/jors.1983.27

Z. Shi, E. Jeannot, and J. J. Dongarra, Robust task scheduling in non-deterministic heterogeneous computing systems, 2006 IEEE International Conference on Cluster Computing, 2006.
DOI : 10.1109/CLUSTR.2006.311868

T. Tobita and H. Kasahara, A standard task graph set for fair evaluation of multiprocessor scheduling algorithms, Journal of Scheduling, vol.70, issue.5, pp.379-394, 2002.
DOI : 10.1002/jos.116

M. Richard and . Van-slyke, Monte Carlo Methods and the PERT Problem, Operations Research, vol.11, issue.5, pp.839-860, 1963.

N. Yazia-pekergin and J. Vincent, Stochastic bounds on execution times of parallel programs, IEEE Transactions on Software Engineering, vol.17, issue.10, pp.1005-1012, 1991.
DOI : 10.1109/32.99189

I. Centre-de-recherche, ?. Nancy, and L. Est, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès