Exact overall time distribution of a project with uncertain task durations

European Journal of Operational Research

Volumn 126, Issue 3, 2000, Pages 614-636

  Schmidt, Craig W ^a   Grossmann, Ignacio E ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; INTEGRATION; PIECEWISE LINEAR TECHNIQUES; POLYNOMIALS; PROBABILITY DENSITY FUNCTION; STATISTICAL METHODS;

CUMULATIVE DISTRIBUTION FUNCTION; GRAPH REDUCTION METHODS; LINEAR TRANSFORMATIONS; MULTIVARIATE STATISTICS;

PERT;

EID: 0034326162     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00316-1     Document Type: Article

References (26)

1. Adlakha V.G., Kulkarni V.G. A classified bibliography of research on stochastic PERT Networks: 1966-1987. INFOR. 27(3):1989;272-296.
2. Bein W.W., Kamburowski J., Stallmann M.F.M. Optimal reduction of two-terminal directed acyclic graphs. SIAM Journal of Computing. 21(6):1992;1112-1129.
3. Bernardini F. Integration of polynomials over n-dimensional polyhedra. Computer Aided Design. 23(1):1991;51-58.
4. Bigelow, C.G. 1962. Bibliography on project planning and control by network analysis: 1959-1961. Operational Research 10 (5), 728-731.
5. Cantor D.G., Dimsdale B. On direction-preserving maps of graphs. Journal of Combinatorial Theory. 6:1969;165-176.
6. DeGroot, M.H., 1986. Probability and Statistics, second ed. Addison-Wesley, Reading, MA.
7. Dirac, P.A.M., 1935. The Principles of Quantum Mechanics, second ed. Clarendon Press, Oxford.
8. Dodin B. Bounding the project completion time distribution in PERT networks. Operations Research. 33(4):1985;862-881.
9. Dodin B. Reducibility of stochastic networks. OMEGA International Journal of Management Science. 13(3):1985;223-232.
10. Hagstrom J.N. Computational complexity of PERT problems. Networks. 18:1988;139-147.
11. Hagstrom J.N. Computing the probability distribution of project duration in a PERT network. Networks. 20:1990;231-244.
12. Hartley H.O., Wortham A.W. A statistical theory for PERT critical path analysis. Management Science. 12(10):1966;B469-B481.
13. Hopcroft J.E., Tarjan R.E. Dividing a graph into triconnected components. SIAM Journal of Computing. 2(3):1973;135-158.
14. Hsu, A., 1997. PD-type Functions: A tractable system of Probability Distribution Functions (in press).
15. Kleindorfer G.B. Bounding distributions for a stochastic acyclic network. Operations Research. 19:1971;1586-1601.
16. Lasserre, J.B., 1997. Integration on a convex polytope. In: Proceedings of the American Mathematical Society (to appear).
17. Lerda-Olberg, S., 1966. Bibliography on network-based project planning and control techniques: 1962-1965. Operations Research 14(5), 925-931.
18. Malcolm D., Roseboom J., Clark C., Fazar W. Application of a technique for research and development program evaluation. Operations Research. 7:1959;646-699.
19. Martin J.J. Distribution of the time through a directed, acyclic network. Operations Research. 13:1965;46-66.
20. Perl Y. Digraphs with maximum number of paths and cycles. Networks. 17:1987;295-305.
21. Ringer L.J. Numerical operators for statistical PERT critical path analysis. Management Science. 16(2):1969;B136-B143.
22. Rudd W.G., Salsburg Z.W., Masinter L.M. Methods of evaluating N-dimensional integrals with polytope bounds. Journal of Computational Physics. 5:1970;125-138.
23. Sterboul F., Wertheimer D. Comment construire un graphe PERT minimal. R.A.I.R.O. Recherche op. é rationnelle/Operations Research 14(1):1980;85-98.
24. Valdes, J., 1978. Parsing flowcharts and series-parallel graphs. Ph.D. Thesis, Department of Computer Science, Stanford University, Stanford, CA.
25. van de Sande, B., 1992. Integration over polytopes. Available from MathSource: http://www.mathsource.com/cgi-bin/msitem/0201-979.
26. Wolfram, S., 1996. The Mathematica Book, third ed. Wolfram Media/Cambridge University Press, Cambridge.