References
- J.M. Burt Jr, and M.B. Garman, “Monte Carlo techniques for stochastic PERT network analysis,” INFOR 9:3 (1971), 248–62
- J.M. Burt, Jr, and M.B. Garman, “Conditional Monte Carlo: a simulation technique for stochastic network analysis,” Mgt. Sci., 18:3 (1971), 207–19
- Mark B. Garman, “More on conditional sampling in the simulation of stochastic networks,” Mgt. Sci., 19:1 (1972), 90–5
- B.M. Dodin, “Reducibility of stochastic networks,” OMEGA 13:3 (May 1985)
- B.M. Dodin and S.E. Elmaghraby, “Approximating the criticality indices of the activities in PERT networks,” Management Science, 31:2 (1985), 207–23
- S.E. Elmaghraby, Activity Networks: Project Planning.and Control by Network Models. New York: John Wiley & Sons, Inc., 1977
- J.F. Hammersley and D.C. Handcomb, Monte Carlo Methods. London: Methuen, 1967
- J.J. Martin, “Distribution of time through a directed acyclic network,” Oper. Res., 13:1 (1965), 46–66
- D.R. O’Connor “Exact distributions of stochastic PERT networks,” University of College of Dublin, Belfield, Dublin 4, Ireland, 1981
- CE. Sigal, A.B. Pritsker, and J.J. Solberg “The use of cutsets in Monte Carlo analysis of stochastic networks,” Mathematics and Computers in Simulation, 21 (1979), 379–84
- CE. Sigal, A.B. Pritsker, and J.J. Solberg, “The stochastic shortest route problem,” Oper. Res., 28: 5 (1980), 1122–9
- R.M. Van Slyke, “Monte Carlo methods and the PERT problem,” Oper. Res. 11:5 (1968), 839–60.