A new structural mechanism for reducibility of stochastic PERT networks

European Journal of Operational Research

Volumn 145, Issue 2, 2003, Pages 394-402

  Fatemi Ghomi, S M T ^a   Rabbani, M ^b  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^b UNIVERSITY OF TEHRAN   (Iran)

Author keywords

Distribution function; Graph theory; Network completion time; Stochastic network; Structural mechanism

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; GRAPH THEORY; PROBABILITY; RANDOM PROCESSES;

STRUCTURAL MECHANISMS;

PERT;

EID: 0037332892     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00155-8     Document Type: Article

References (21)

1. Chartrand G., Lesniak L. Graphs and Digraphs. 1986;Wadworth, Belmont, CA.
2. Clingen C.T. A modification of Fulkerson's PERT algorithm. Operations Research. 12(4):1964;629-632.
3. Dodin B.M. Determining the K most critical paths in PERT network. Operations Research. 32(4):1984;859-877.
4. Dodin B.M. Approximating the distribution function in stochastic network. Computers and Operations Research. 12(3):1985;251-264.
5. Dodin B.M. Bounding the project completion time distribution in PERT network. Journal of Operations Research. 33(4):1985;826-881.
6. Dodin B., Elmaghraby S.E. Approximating the criticality indices of the activities in PERT networks. Management Science. 31(2):1985;207-223.
7. Elmaghraby S.E. On the expected duration of PERT type network. Management Science. 13(5):1967;299-306.
8. Fisher D.L., Saisi D., Goldstein W.M. Stochastic PERT networks: op diagrams, critical paths and the project completion time Computers and Operations Research. 12(5):1985;471-482.
9. Fulkerson D.R. Expected critical path length in PERT network. Operations Research. 10(6):1962;808-817.
10. Harthley H.O., Wortham A.W. A statistical theory for PERT critical path analysis. Management Science. 12(10):1966;469-481.
11. Kamburowski J. An upper bound on the expected completion time of PERT network. European Journal of Operational Research. 21(2):1985;206-212.
12. Kleindorfer G.B. Bounding distributions for a stochastic acyclic network. Journal of Operations Research. 19(7):1977;1586-1601.
13. Kulkarni V.G., Adlakha V.G. Markov and Markov regenerative PERT network. Journal of Operations Research. 34(5):1980;769-781.
14. Lindsey J.H. An estimate of expected critical path length in PERT network. Journal of Operations Research. 20(4):1972;800-812.
15. Martin J.J. Distribution of the time through a directed, acyclic network. Operations Research. 13(1):1965;46-66.
16. Ringer L.J. Numerical operators for statistical PERT critical path analysis. Management Science. 16(2):1969;136-143.
17. Robillard P., Trahan M. Expected completion time in PERT network. Operations Research. 24(1):1976;177-182.
18. Robillard P., Trahan M. The completion time of PERT network. Journal of Operations Research. 25(1):1977;15-29.
19. Sculli D. The completion times of PERT network. Journal of Operations Research Society. 34(2):1983;155-158.
20. Sigal C.E., Pritsker A.A.B., Solberg J.J. The use of cutsets in Monte Carlo analysis of stochastic network. Mathematics and Computers in Simulation. 21:1979;376-384.
21. Van Slyke R.M. Monte Carlo methods and the PERT problem. Operations Research. 11(5):1963;839-860.