Resource allocation for a stochastic CPM-type network through perturbation analysis
暂无分享,去创建一个
[1] W. Whitt. Planning queueing simulations , 1989 .
[2] A. Alan B. Pritsker. Simulation With GASP-II , 1969 .
[3] Salah E. Elmaghraby,et al. Project bidding under deterministic and probabilistic activity durations , 1990 .
[4] John B. Kidd. A comparison between the VERT program and other methods of project duration estimation , 1987 .
[5] Xi-Ren Cao. Convergence of parameter sensitivity estimates in a stochastic experiment , 1984, The 23rd IEEE Conference on Decision and Control.
[6] Patrick Billingsley,et al. Probability and Measure. , 1986 .
[7] D. Yao,et al. DERIVATIVES OF THE EXPECTED DELAY IN THE GI/G/1 QUEUE , 1990 .
[8] Yu-Chi Ho,et al. A gradient technique for general buffer storage design in a production line , 1979 .
[9] R. Suri,et al. Perturbation analysis gives strongly consistent sensitivity estimates for the M/G/ 1 queue , 1988 .
[10] Xi-Ren Cao,et al. Perturbation analysis of discrete event dynamic systems , 1991 .
[11] Jian-Qiang Hu. Consistency of infinitesimal perturbation analysis estimators with rates , 1991, Queueing Syst. Theory Appl..
[12] Paul Glasserman,et al. Gradient Estimation Via Perturbation Analysis , 1990 .
[13] F. F. Boctor,et al. Some efficient multi-heuristic procedures for resource-constrained project scheduling , 1990 .
[14] John B. Kidd. Do today's projects need powerful network planning tools? , 1991 .
[15] Bajis M. Dodin,et al. Bounding the Project Completion Time Distribution in PERT Networks , 1985, Oper. Res..