Bounding Distributions for Stochastic Logic Networks
暂无分享,去创建一个
[1] D. P. Gaver,et al. Simple stochastic networks: Some problems and procedures , 1970 .
[2] Howard Eisner. A Generalized Network Approach to the Planning and Scheduling of a Research Project , 1962 .
[3] G. Thompson,et al. Critical Path Analyses Via Chance Constrained and Stochastic Programming , 1964 .
[4] Van Slyke,et al. MONTE CARLO METHODS AND THE PERT PROBLEM , 1963 .
[5] George B. Kleindorfer,et al. Bounding Distributions for a Stochastic Acyclic Network , 1971, Oper. Res..
[6] S. Elmaghraby. An Algebra for the Analysis of Generalized Activity Networks , 1964 .
[7] Gerald A. Maley,et al. The Logic Design of Transistor Digital Computers , 1967 .
[8] P. C. Roberts,et al. Stochastic-network Reduction and Sensitivity Techniques in a Cost Effectiveness Study of a Military Communications System , 1970 .
[9] A. Alan B. Pritsker,et al. GERT - Graphical Evaluation and Review Technique , 1966 .
[10] S. Elmaghraby. On the Expected Duration of PERT Type Networks , 1967 .
[11] D. R. Fulkerson. Expected Critical Path Lengths in PERT Networks , 1962 .
[12] A. W. Wortham,et al. A Statistical Theory for PERT Critical Path Analysis , 1966 .