T. W. Anderson, On the Distribution of the Two-Sample Cramer-von Mises Criterion, The Annals of Mathematical Statistics, vol.33, issue.3, pp.1148-1159, 1962.
DOI : 10.1214/aoms/1177704477

H. Alfredo, W. H. Ang, and . Tang, Probability Concepts in Engineering: Emphasis on Applications to Civil and Environmental Engineering, 2006.

W. W. Bein, J. Kamburowski, and M. F. Stallmann, Optimal Reduction of Two-Terminal Directed Acyclic Graphs, SIAM Journal on Computing, vol.21, issue.6, pp.1112-1129, 1992.
DOI : 10.1137/0221065
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.7263

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

D. Blaauw, K. Chopra, A. Srivastava, and L. Scheffer, Statistical Timing Analysis: From Basic Principles to State of the Art, IEEE International Symposium on Circuits and Systems, pp.589-607, 1989.
DOI : 10.1109/TCAD.2007.907047

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.

L. Canon, Emapse: code and scripts, 2015.

C. Louis, E. Canon, and . Jeannot, Evaluation and Optimization of the Robustness of DAG Schedules in Heterogeneous Environments, IEEE Transactions on Parallel and Distributed Systems, vol.21, issue.4, pp.532-546, 2010.

K. M. Chandy and P. F. Reynolds, Scheduling partially ordered tasks with probabilistic execution times, SOSP '75: Proceedings of the fifth ACM symposium on Operating systems principles, pp.169-177, 1975.
DOI : 10.1145/1067629.806534

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

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

D. R. Fulkerson, Expected Critical Path Lengths in PERT Networks, Operations Research, vol.10, issue.6, pp.808-817, 1962.
DOI : 10.1287/opre.10.6.808
URL : http://www.dtic.mil/get-tr-doc/pdf?AD=AD0274597

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

C. Mark, H. Hansen, J. P. Yalcin, and . Hayes, Unveiling the iscas-85 benchmarks: A case study in reverse engineering, IEEE Design & Test, vol.16, issue.3, pp.72-80, 1999.

F. B. Hildebrand, Introduction to Numerical Analysis, 1987.

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

R. Kolisch and A. Sprecher, PSPLIB - A project scheduling problem library, European Journal of Operational Research, vol.96, issue.1, pp.205-216, 1996.
DOI : 10.1016/S0377-2217(96)00170-1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.7064

S. Mukkai, N. Krishnamoorthy, and . Deo, Complexity of the minimum-dummyactivities problem in a pert network, Networks, vol.9, issue.3, pp.189-194, 1979.

K. Li, X. Tang, B. Veeravalli, and K. Li, Scheduling Precedence Constrained Stochastic Tasks on Heterogeneous Cluster Systems, ] Arfst Ludwig, Rolf H. Möhring, and Frederik Stork. A Computational Study on Bounding the Makespan Distribution in Stochastic Project Networks, pp.191-2041, 2001.
DOI : 10.1109/TC.2013.205

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

M. Matsumoto and T. Nishimura, Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator, ACM Transactions on Modeling and Computer Simulation, vol.8, issue.1, pp.3-30, 1998.
DOI : 10.1145/272991.272995
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.1141

H. Rolf and . Möhring, Scheduling under uncertainty: Bounding the makespan distribution, Computational Discrete Mathematics, pp.79-97, 2001.

C. Douglas, G. C. Montgomery, and . Runger, Applied Statistics and Probability for Engineers, 2010.

A. Müller and D. Stoyan, Comparison Methods for Stochastic Models and Risks, 2002.

L. Michael and . Pinedo, Stochastic Scheduling with Release Dates and Due Dates, Operations Research, vol.31, issue.3, pp.559-572, 1983.

L. Michael and . Pinedo, Scheduling: Theory, Algorithms , and Systems, 2008.

P. Robillard and M. Trahan, Technical Note???Expected Completion Time in Pert Networks, Operations Research, vol.24, issue.1, pp.177-182, 1976.
DOI : 10.1287/opre.24.1.177

S. Sachin, H. Sapatnekar, and . Chang, Statistical Timing Analysis Under Spatial Correlations, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.24, issue.9, pp.1467-1482, 2005.

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

M. A. Stephens, Tests based on edf statistics, Goodness-of-Fit Techniques, pp.97-193, 1986.
DOI : 10.1002/0471667196.ess0535

G. Thomas and . Stockham, High-speed convolution and correlation, Proceedings of the AFIPS Sprinp Joint Computer Conference, pp.229-233, 1966.

X. Tang, K. Li, G. Liao, K. Fang, and F. Wu, A stochastic scheduling algorithm for precedence constrained tasks on Grid, Future Generation Computer Systems, vol.27, issue.8, pp.1083-1091, 2011.
DOI : 10.1016/j.future.2011.04.007

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.

C. Visweswariah, K. Ravindran, K. Kalafala, S. G. Walker, S. Narayan et al., First-order incremental block-based statistical timing analysis, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, issue.10, pp.252170-2180, 2006.
DOI : 10.1145/996566.996663
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.6246

R. R. Weber, Scheduling jobs with stochastic processing requirements on parallel machines to minimize makespan or flowtime, Journal of Applied Probability, vol.19, issue.1, pp.167-182, 1982.
DOI : 10.2307/3213926

G. Weiss, Stochastic Bounds on Distributions of Optimal Value Functions with Applications to PERT, Network Flows and Reliability, Operations Research, vol.34, issue.4, pp.59-65, 1984.
DOI : 10.1287/opre.34.4.595

M. Yao and W. Chu, A new approximation algorithm for obtaining the probability distribution function for project completion time, Computers & Mathematics with Applications, vol.54, issue.2, pp.282-295, 2007.
DOI : 10.1016/j.camwa.2007.01.036

N. Yazici-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

L. Zhang, W. Chen, Y. Hu, C. Chung, and -. Chen, Statistical static timing analysis with conditional linear MAX/MIN approximation and extended canonical timing model, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.25, issue.6, pp.1183-1191, 2006.
DOI : 10.1109/TCAD.2005.855979

W. Zheng and R. Sakellariou, Stochastic DAG scheduling using a Monte Carlo approach, Journal of Parallel and Distributed Computing, vol.73, issue.12, pp.1673-1689, 2013.
DOI : 10.1016/j.jpdc.2013.07.019