Chapter 1 – THE ESTIMATION OF SOME NETWORK PARAMETERS IN THE PERT MODEL OF ACTIVITY NETWORKS: REVIEW AND CRITIQUE

[1]  D. Malcolm,et al.  Application of a Technique for Research and Development Program Evaluation , 1959 .

[2]  James E. Kelley,et al.  Critical-path planning and scheduling , 1899, IRE-AIEE-ACM '59 (Eastern).

[3]  C. E. Clark.  The Greatest of a Finite Set of Random Variables , 1961 .

[4]  D. R. Fulkerson.  Expected Critical Path Lengths in PERT Networks , 1962 .

[5]  Van Slyke,et al.  MONTE CARLO METHODS AND THE PERT PROBLEM , 1963 .

[6]  Richard M. Van Slyke,et al.  Letter to the Editor---Monte Carlo Methods and the PERT Problem , 1963 .

[7]  G. Thompson,et al.  Critical Path Analyses Via Chance Constrained and Stochastic Programming , 1964 .

[8]  A. F. Veinott.  Optimal Policy in a Dynamic, Single Product, Nonstationary Inventory Model with Several Demand Classes , 1965 .

[9]  J. J. Martin.  Distribution of the Time Through a Directed, Acyclic Network , 1965 .

[10]  A. W. Wortham,et al.  A Statistical Theory for PERT Critical Path Analysis , 1966 .

[11]  D. Walkup,et al.  Association of Random Variables, with Applications , 1967 .

[12]  S. Elmaghraby.  On the Expected Duration of PERT Type Networks , 1967 .

[13]  L. Ringer.  Numerical Operators for Statistical PERT Critical Path Analysis , 1969 .

[14]  D. P. Gaver,et al.  Simple stochastic networks: Some problems and procedures , 1970 .

[15]  John M. Burt,et al.  Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis , 1971 .

[16]  M. Garman.,et al.  Monte Carlo Techniques for Stochastic Pert Network Analysis , 1971 .

[17]  George B. Kleindorfer,et al.  Bounding Distributions for a Stochastic Acyclic Network , 1971, Oper. Res..

[18]  Mark B. Garman.  More on Conditioned Sampling in the Simulation of Stochastic Networks , 1972 .

[19]  R. Davies.  Numerical inversion of a characteristic function , 1973 .

[20]  Jack P. C. Kleijnen.  Antithetic Variates, Common Random Numbers and Optimal Computer Time Allocation in Simulation , 1975 .

[21]  Pierre N. Robillard,et al.  Technical Note - Expected Completion Time in Pert Networks , 1976, Oper. Res..

[22]  Andrew W. Shogan.  Bounding distributions for a stochastic pert network , 1977, Networks.

[23]  Pierre N. Robillard,et al.  The Completion Time of PERT Networks , 1977, Oper. Res..

[24]  H. Niederreiter.  Quasi-Monte Carlo methods and pseudo-random numbers , 1978 .

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

[26]  James J. Solberg,et al.  The use of cutsets in Monte Carlo analysis of stochastic networks , 1979 .

[27]  James J. Solberg,et al.  The Stochastic Shortest Route Problem , 1980, Oper. Res..

[28]  Salah E. Elmaghraby,et al.  On the measurement of complexity in activity networks , 1980 .

[29]  Jack C. Hayya,et al.  Efficiency of the Antithetic Variate Method for Simulating Stochastic Networks , 1982 .

[30]  D. Sculli.  The Completion Time of PERT Networks , 1983 .

[31]  Floyd H. Grant.  Note-A Note on Efficiency of the Antithetic Variate Method for Simulating Stochastic Networks , 1983 .

[32]  J. Scott Provan,et al.  Calculating bounds on reachability and connectedness in stochastic networks , 1983, Networks.

[33]  Bajis M. Dodin.  Determining the K Most Critical Paths in PERT Networks , 1984, Oper. Res..

[34]  Bajis M. Dodin,et al.  Approximating the Criticality Indices of the Activities in PERT Networks , 1985 .

[35]  Jerzy Kamburowski.  Two-point approximations for activity times in PERT networks , 1985 .

[36]  Bajis M. Dodin,et al.  Bounding the Project Completion Time Distribution in PERT Networks , 1985, Oper. Res..

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

[38]  G. S. Fishman.  Estimating Network Characteristics in Stochastic Activity Networks , 1985 .