论文信息 - Computational complexity of PERT problems

Computational complexity of PERT problems

Computational complexity results for two PERT problems are presented. A project is specified by precedence relations among tasks. Task durations are independent random variables with discrete, finite ranges. The following results are obtained: (1) computing a value of the cumulative distribution function of project duration is #P-complete, (2) computing the mean of the distribution is at least as hard, and (3) neither of the problems in (1) and (2) can be computed in time polynomial in the number of points in the range of the project duration unless P = NP.

Jane N. Hagstrom | J. N. Hagstrom

[1] Pitu B. Mirchandani,et al. Shortest distance and reliability of probabilistic networks , 1976, Comput. Oper. Res..

[2] Leslie G. Valiant,et al. The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[3] J. Scott Provan,et al. The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

[4] Bajis M. Dodin,et al. Bounding the Project Completion Time Distribution in PERT Networks , 1985, Oper. Res..

[5] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[6] J. Scott Provan,et al. Computing Network Reliability in Time Polynomial in the Number of Cuts , 1984, Oper. Res..

[7] Andrew W. Shogan. Bounding distributions for a stochastic pert network , 1977, Networks.