A new probability model for insuring critical path problem with heuristic algorithm
暂无分享,去创建一个
[1] James E. Kelley,et al. Critical-Path Planning and Scheduling: Mathematical Basis , 1961 .
[2] T. D. Klastorin,et al. An effective methodology for the stochastic project compression problem , 2007 .
[3] Russell C. Eberhart,et al. A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.
[4] James Kennedy,et al. Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.
[5] Witold Pedrycz,et al. Modified binary particle swarm optimization , 2008 .
[6] Tariq Haroon Ahmad,et al. Project management with CPM , 1976 .
[7] Loris Nanni,et al. Particle swarm optimization for prototype reduction , 2009, Neurocomputing.
[8] Yen-Liang Chen,et al. Critical path in an activity network with time constraints , 1997, Eur. J. Oper. Res..
[9] Peter Kall,et al. Stochastic Linear Programming , 1975 .
[10] Michael C. Fu,et al. Conditional Monte Carlo , 1997 .
[11] Rolf H. Möhring,et al. Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time , 1984, Oper. Res..
[12] J. B. Ritter,et al. The Critical-Path Method , 1965 .
[13] Jonathan Cole Smith,et al. Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths , 2010, Manag. Sci..
[14] Yankui Liu,et al. Modeling data envelopment analysis by chance method in hybrid uncertain environments , 2010, Math. Comput. Simul..
[15] John M. Wilson,et al. Introduction to Stochastic Programming , 1998, J. Oper. Res. Soc..
[16] John M. Burt,et al. Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis , 1971 .
[17] P. Kall. STOCHASTIC LINEAR PROGRAMMING Models , Theory , and Computation , 2013 .
[18] Xiaoli Wu,et al. A new Chance-Variance optimization criterion for portfolio selection in uncertain decision systems , 2012, Expert Syst. Appl..
[19] James E. Kelley,et al. Critical-path planning and scheduling , 1899, IRE-AIEE-ACM '59 (Eastern).
[20] Yankui Liu,et al. A new data envelopment analysis model with fuzzy random inputs and outputs , 2010 .
[21] R. Bellman. Dynamic programming. , 1957, Science.
[22] Alexander Shapiro,et al. A simulation-based approach to two-stage stochastic programming with recourse , 1998, Math. Program..
[23] Hong He,et al. A two-stage genetic algorithm for automatic clustering , 2012, Neurocomputing.
[24] Технология. Springer Science+Business Media , 2013 .
[25] R. A. Bowman. Efficient estimation of arc criticalities in stochastic activity networks , 1995 .
[26] Francesca Guerriero,et al. A solution approach to find the critical path in a time-constrained activity network , 2010, Comput. Oper. Res..
[27] Jian Qin,et al. A dynamic chain-like agent genetic algorithm for global numerical optimization and feature selection , 2009, Neurocomputing.
[28] James R. Luedtke,et al. A Sample Approximation Approach for Optimization with Probabilistic Constraints , 2008, SIAM J. Optim..
[29] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .