Mean Project Completion Time in Dynamic Markov PERT Networks

Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatoshi Sakawa
[3] Charnes, A., Cooper, W., Thompson, G. (1964). Critical path analysis
via chance constrained and stochastic programming. Operations Research,
12, 460-470.
[4] Clingen, C. (1964). A modification of fulkerson’s algorithm for expected
duration of a PERT project when activities have continuos d. f.
Operations Research, 12, 629-632.
[5] Elmaghraby, S. (1967). On the expected duration of PERT type networks.
Management Science, 13, 299-306.
[6] Fulkerson, D. (1962). Expected critical path lengths in PERT networks.
Operations Research, 10, 808-817.
[7] Hall, R. (1986). The fastest path through a network with random timedependent
travel times. Transportation Science, 20, 182-188.
[8] Howard, D. (1970). Dynamic probabilistic systems. John Wiley & Sons,
New York.
[9] Kulkarni, V., Adlakha, V. (1986). Markov and markov-regenerative
PERT networks. Operations Research, 34, 769-781.
[10] Martin, J. (1965). Distribution of the time through a directed acyclic
network. Operations Research, 13, 46-66.
[11] Perry, C., Creig, I. (1975). Estimating the mean and variance of subjective
distributions in PERT and decision analysis. Management Science, 21,
1477-1480.
[12] Psaraftis, H., Tsitsiklis, J. (1993). Dynamic shortest paths in acyclic
networks with markovian arc costs. Operations Research, 41, 91-101.
[13] Robillard, P. (1976). Expected completion time in PERT networks. Operations
Research, 24, 177-182.
782