马尔可夫骨架PERT网络的最长路径

The Longest Path of Markov Skeleton PERT Networks

本文利用马尔可夫骨架过程理论研究PERT网络模型,其中网络各弧线的长度是相互独立的随机变量。文中构造了一个马尔可夫骨架过程,利用其向后方程求解随机网络最长路径长度的分布函数。

In this paper, we use the Markov skeleton processes to study the PERT networks,where the activity durations are mutually independent random variables. A Markov skeleton process is constructed, and we apply its backward equation to solving the distribution function of the longest path.