Evolutionary algorithms for the project scheduling problem: runtime analysis and improved design
暂无分享,去创建一个
[1] Frank Neumann,et al. Bioinspired computation in combinatorial optimization: algorithms and their computational complexity , 2012, GECCO '12.
[2] Thomas Stützle,et al. Local Search Algorithms for SAT: An Empirical Evaluation , 2000, Journal of Automated Reasoning.
[3] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[4] María Dolores Rodríguez-Moreno,et al. Statistical Distribution of Generation-to-Success in GP: Application to Model Accumulated Success Probability , 2011, EuroGP.
[5] Xin Yao,et al. Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results , 2007, Int. J. Autom. Comput..
[6] Tao Zhang,et al. Genetic Algorithms for Project Management , 2001, Ann. Softw. Eng..
[7] Andrew Smith,et al. Optimized staffing for product releases and its application at Chartwell Technology , 2008, J. Softw. Maintenance Res. Pract..
[8] A. Agresti,et al. Approximate is Better than “Exact” for Interval Estimation of Binomial Proportions , 1998 .
[9] Martin Lukasiewycz,et al. Opt4J: a modular framework for meta-heuristic optimization , 2011, GECCO '11.
[10] Daniel Johannsen,et al. Random combinatorial structures and randomized search heuristics , 2010 .
[11] Thomas Jansen,et al. Optimizing Monotone Functions Can Be Difficult , 2010, PPSN.
[12] Enrique Alba,et al. Software project management with GAs , 2007, Inf. Sci..
[13] Carl K. Chang,et al. Time-line based model for software project scheduling with genetic algorithms , 2008, Inf. Softw. Technol..
[14] Janez Demsar,et al. Statistical Comparisons of Classifiers over Multiple Data Sets , 2006, J. Mach. Learn. Res..