Markov and Markov-Regenerative pert Networks

This paper investigates pert networks with independent and exponentially distributed activity durations. We model such networks as finite-state, absorbing, continuous-time Markov chains with upper triangular generator matrices. The state space is related to the network structure. We present simple and computationally stable algorithms to evaluate the usual performance criteria: the distribution and moments of project completion time, the probability that a given path is critical, and other related performance measures. In addition, we algorithmically analyze conditional performance measures-for example, project completion time, given a critical path-and present computational results. We then study extensions both to resource-constrained pert networks and to a special class of nonexponential pert networks.

[1]  Richard Loulou,et al.  A Comparison Of Variance Reducing Techniques In Pert Simulations , 1976 .

[2]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[3]  Richard E. Barlow,et al.  Statistical Theory of Reliability and Life Testing: Probability Models , 1976 .

[4]  C. T. Clingen.  Letter to the Editor-A Modification of Fulkerson's PERT Algorithm , 1964 .

[5]  Mark B. Garman.  More on Conditioned Sampling in the Simulation of Stochastic Networks , 1972 .

[6]  James J. Solberg,et al.  The use of cutsets in Monte Carlo analysis of stochastic networks , 1979 .

[7]  James J. Solberg,et al.  The Stochastic Shortest Route Problem , 1980, Oper. Res..

[8]  S. Elmaghraby.  On the Expected Duration of PERT Type Networks , 1967 .

[9]  George S. Fishman.  Estimating critical path and arc probabilities in stochastic activity networks , 1985 .

[10]  John M. Burt,et al.  Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis , 1971 .

[11]  Pierre N. Robillard,et al.  Technical Note - Expected Completion Time in Pert Networks , 1976, Oper. Res..

[12]  D. R. Fulkerson.  Expected Critical Path Lengths in PERT Networks , 1962 .

[13]  G. Thompson,et al.  Critical Path Analyses Via Chance Constrained and Stochastic Programming , 1964 .

[14]  Salah E. Elmaghraby,et al.  Activity networks: Project planning and control by network models , 1977 .

[15]  Kishor S. Trivedi.  Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .

[16]  C. Perry,et al.  Estimating the Mean and Variance of Subjective Distributions in PERT and Decision Analysis , 1975 .

[17]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[18]  Van Slyke,et al.  MONTE CARLO METHODS AND THE PERT PROBLEM , 1963 .

[19]  J. J. Martin.  Distribution of the Time Through a Directed, Acyclic Network , 1965 .