[1] Charnes A, Copper W, Thompson G. Critical path analysis via chance constrained and stochastic programming. Operations Research, 1964, 12: 460--470
[2] Elmaghraby S. On the expected duration of PERT type networks. Management Science, 1976, 13: 299--306
[3] Van Slyke R. Monte carlo methods and the PERT problem. Operations Research, 1963, 11: 839--860
[4] Kulkarni V, Adlakha V. Markov and Markov-Regenerative PERT networks. Operations Research, 1986, 34: 769--781
[5] Azaron A, Katagiri H, Sakawa M, et al. Multi-objective resource allocation problem in PERT networks. European Journal of Operational Research, 2006, 172: 838--854
[6] Azaron A, Tavakkoli-Moghaddam R. A multi-objective resource allocation problem in dynamic PERT networks. Applied Mathematics and
Computation, 2006, 181: 163--174
[7] Azaron A, Katagiri H, Kato K, et al. Longest path analysis in network of queues. European Journal of Operational Research, 2006, 174: 132--149
[8] Hou Z T, Liu G X. Markov Skeleton Processes and Their Applications. 2nd ed. Beijing: Science Press, Boston: International Press, 2005
[9] Loulou R, Beale T. A comparison of variance reducing techniques in PERT simulations. Canadian Journal of Operations Research and Information, 1976, 14: 259--269
|