MOEA/D for flowshop scheduling problems
暂无分享,去创建一个
Qingfu Zhang | Pei-Chann Chang | Jun-Lin Lin | Shih-Hsin Chen | P. Chang | Qingfu Zhang | Shih-Hsin Chen | Jun-Lin Lin
[1] Hisao Ishibuchi,et al. Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..
[2] Marco Laumanns,et al. SPEA2: Improving the Strength Pareto Evolutionary Algorithm For Multiobjective Optimization , 2002 .
[3] Kalyanmoy Deb,et al. A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..
[4] R. K. Ursem. Multi-objective Optimization using Evolutionary Algorithms , 2009 .
[5] Pei-Chann Chang,et al. Two-phase sub population genetic algorithm for parallel machine-scheduling problem , 2005, Expert Syst. Appl..
[6] Hisao Ishibuchi,et al. Performance evaluation of genetic algorithms for flowshop scheduling problems , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.
[7] Qingfu Zhang,et al. Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II , 2009, IEEE Transactions on Evolutionary Computation.
[8] Tapan P. Bagchi,et al. Multiobjective Scheduling by Genetic Algorithms , 1999 .
[9] Kaisa Miettinen,et al. Nonlinear multiobjective optimization , 1998, International series in operations research and management science.
[10] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .
[11] Qingfu Zhang,et al. MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.
[12] Qguhm -DVNLHZLF,et al. On the performance of multiple objective genetic local search on the 0 / 1 knapsack problem . A comparative experiment , 2000 .