论文信息 - Estimating the mean completion time of PERT networks with exponentially distributed durations of activities

Estimating the mean completion time of PERT networks with exponentially distributed durations of activities

Abstract In order to compute the exact values of the characteristics for PERT networks with exponentially distributed durations of activities, one need to explore the state space of a Markov chain. This method suffers from exponential state explosion. An approximate method for estimating the mean completion time of the above networks is proposed in this paper. Our method is of polynomial computational complexity. The accuracy of the method is compared with the best upper bound for the considered kind of networks.

Jan Magott | Kamil Skudlarski | J. Magott | Kamil Skudlarski

[1] Ward Whitt,et al. Comparison methods for queues and other stochastic models , 1986 .

[2] T. H. Savits,et al. The IFRA Closure Problem , 1976 .

[3] S. Elmaghraby. Chapter 1 – THE ESTIMATION OF SOME NETWORK PARAMETERS IN THE PERT MODEL OF ACTIVITY NETWORKS: REVIEW AND CRITIQUE , 1989 .

[4] Vidyadhar G. Kulkarni,et al. Markov and Markov-Regenerative pert Networks , 1986, Oper. Res..

[5] Luc Devroye. Inequalities for the Completion Times of Stochastic PERT Networks , 1979, Math. Oper. Res..

[6] Jerzy Kamburowski,et al. An upper bound on the expected completion time of PERT networks , 1985 .

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

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

[9] Terry Williams,et al. Probability and Statistics with Reliability, Queueing and Computer Science Applications , 1983 .

[10] Jan Magott,et al. Combining generalized stochastic Petri nets and PERT networks for the performance evaluation of concurrent processes , 1989, Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89.