On criticality and sensitivity in activity networks

European Journal of Operational Research

Volumn 127, Issue 2, 2000, Pages 220-238

  Elmaghraby, Salah E ^a  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MARKOV PROCESSES; MONTE CARLO METHODS; PERT; POLYNOMIALS; SAMPLING; SENSITIVITY ANALYSIS;

ACTIVITY NETWORKS; CRITICAL ACTIVITY; MONTE CARLO SAMPLING; PROJECT COMPLETION; TAGUCHI ORTHOGONAL ARRAYS;

PROJECT MANAGEMENT;

EID: 0034559444     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00483-X     Document Type: Article

References (25)

1. Anklesaria K.P., Drezner Z. A multivariate approach to estimating the completion time for PERT networks. Operations Research. 37:1986;811-815.
2. Box G.E.P., Wilson K.B. On the experimental attainment of optimum conditions. Journal of the Royal Statistical Society B. 13:1951;1-45.
3. Bowman R.A. Efficient estimation of arc criticalities in stochastic activity networks. Management Science. 41:1995;58-67.
4. Bowman R.A. Stochastic gradient-based time-cost trade-offs in PERT networks using simulation. Annals of Operations Research. 53:1994;533-551.
5. Bowman R.A., Muckstadt J.A. Stochastic analysis of cyclic schedules. Operations Research. 41:1993;947-958.
6. Bullington K.E., Hool J.N., Maghsoodlo S. A simple method for obtaining resolution IV designs for use with Taguchi's orthogonal arrays. Journal of Qualitative Technology. 22:1990;260-264.
7. Cho J.G., Yum B.J. An uncertainty importance measure of activities in PERT networks. IJPR. 35:1997;2737-2770.
8. Clark C.E. The greatest of a finite set of random variables. Operations Research. 9:1961;145-162.
9. A. Dey, Orthogonal Fractional Factorial Designs, Wiley, New York, 1985.
10. B.M. Dodin, Approximating the probability distribution function of the project completion time in PERT networks, or Report No. 153 (Revised), or Program, North Carolina State University at Raleigh, June 1980.
11. Dodin B.M., Elmaghraby S.E. Approximating the criticality indices of the activities in PERT networks. Management Science. 31:1985;207-223.
12. S.E., Elmaghraby, Activity Networks: Project Planning and Control by Network Models, Wiley, New York, 1977.
13. S.E., Elmaghraby, Y. Fathi, M.R. Taner, On the sensitivity of project variability to activity mean duration, Research Report, North Carolina State University, Raleigh, NC 27695-7906, 1998.
14. G. Gutierrez, A. Paul, Analysis of the effects of uncertainty, risk-pooling and subcontracting mechanisms on project performance, Technical Report, the University of Texas at Austin, 1998.
15. J.E. Kelley Jr., M.R. Walker, Critical path planning and scheduling, in: Proceedings of the Eastern Joint Computational Conference, vol. 16, 1959, pp. 160-172.
16. Kleindorfer G.B. Bounding distribution for a stochastic acyclic network. Operations Research. 19:1971;1586-1601.
17. Kulkarni V.G., Adlakha V.G. Markov and Markov-regenerative pert networks. Operations Research. 34:1986;769-781.
18. Malcolm D.G., Roseboom J.H., Clark C.E., Fazar W. Applications of a technique for research and development program evaluation. Operations Research. 7:1959;646-669.
19. Marshall A.W., Proschan F. Mean life of series and parallel systems. Journal of Applied Probability. 7:1970;165-174.
20. Martin J.J. Distribution of time through a directed acyclic network. Operations Research. 13:1965;46-66.
21. Schonberger R.J. Why projects are 'always' late. Interfaces. 2(5):1981;66-67.
22. Sigal C.E., Pritsker A.B., Solberg J.J. Use the of cutsts in Monte Carlo analysis of stochastic networks. Mathematics and Computers in Simulation. 21:1979;376-384.
23. G. Taguchi, System of Experimental Design, vols. 1 and 2, UNIPUB/Kraus International Publications, New York, 1987.
24. van Slyke R.M. Monte Carlo methods and the PERT problem. Operations Research. 11:1963;839-860.
25. Williams T.M Criticality in stochastic networks. Operations Research. 43:1992;353-357.