[1] NASIRI M M, KIANFAR F. A GES/TS algorithm for the job shop scheduling [J]. Computers and Industrial Engineering, 2012, 62(4): 946-952. [2] BRUKER P, SCHLIE R. Job-shop scheduling with multi-purpose machines [J]. Computing, 1990, 45(4): 369-375. [3] GU F. Optimization algorithm research for flexible job shop scheduling [D]. Hefei: University of Science and Technology of China, 2006. (谷峰.柔性作业车间调度中的优化算法研究[D]. 合肥: 中国科学技术大学, 2006.) [4] LI X, LU J, CHAI G, et al. Hybrid bee colony algorithm for flexible job shop scheduling problem [J]. Computer Integrated Manufacturing Systems, 2011, 17(7): 1495-1500. (李修琳, 鲁建厦, 柴国钟, 等.混合蜂群算法求解柔性作业车间调度问题[J].计算机集成制造系统, 2011, 17(7):1495-1500.) [5] ZHAO S, FANG S, GU X. Machine selection and FJSP solution based on limit scheduling completion time minimization [J]. Computer Integrated Manufacturing Systems, 2014, 20(4): 854-865. (赵诗奎, 方水良, 顾新建.基于极限调度完工时间最小化的机器选择及FJSP求解[J].计算机集成制造系统, 2014, 20(4):854-865.) [6] WANG X. Research on methods for multi-objection flexible job-shop scheduling problem [D]. Wuhan: Huazhong University of Science and Technology, 2011. (王晓娟.多目标柔性作业车间调度方法研究[D].武汉:华中科技大学, 2011.) [7] RAHMATI M, ZANDIEH M, YAZDANI M, et al. Developing two multi-objective evolutionary algorithms for the multi-objective flexible job shop scheduling problem [J]. The International Journal of Advanced Manufacturing Technology, 2013, 64(5/6/7/8): 915-932. [8] WANG W, LI J, WANG J. Double-population genetic algorithm for multi-objection job shop scheduling problem [J]. Computer Integrated Manufacturing Systems, 2011, 17(4): 808-815. (王伟玲, 李俊芳, 王晶.求解多目标作业车间调度问题的双种群遗传算法[J].计算机集成制造系统, 2011, 17(4):808-815.) [9] XIA W, WU Z. An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problem [J]. Computers and Industrial Engineering, 2005, 48(2): 409-425. [10] LI J-Q, PAN Q-K, GAO K-Z. Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems [J]. International Journal of Advanced Manufacturing Technology, 2011, 55(9/10/11/12): 1159- 1169. [11] LIM W H, MAT ISA N A. Teaching and peer-learning particle swarm optimization [J]. Applied Soft Computing, 2014, 18: 39-58. [12] DEB K, PRATAP A, AGARWAL S, et al.A fast and elitist multi-objective genetic algorithm: NSGA-II [J]. IEEE Transactions on Evolutionary Computation, 2002, 6(2): 182-197. [13] KENNEDY J, EBERHART R. Particle swarm optimization [C]//Proceedings of the 1995 IEEE International Conference on Neural Networks. Piscataway, IEEE, 1995, 4: 1942-1948. [14] RAO R V, SAVSANI V J, VAKHARIA D P. Teaching-learning based optimization: a novel method for constrained mechanical design optimization problems [J]. Computer-Aided Design, 2011, 43(3): 303-315. [15] HO N B, TAY J C, LAI E M-K. An effective architecture for learning and evolving flexible job-shop schedules [J]. European Journal of Operational Research, 2007, 179(2): 316-333. [16] CHEN G, JIA J, HAN Q. Study on the strategy of decreasing inertia weight in particle swarm optimization algorithm [J]. Journal of Xi'an Jiaotong University, 2006, 40(1): 53-56, 61. (陈贵敏, 贾建援, 韩琪.粒子群优化算法的惯性权值递减策略研究[J].西安交通大学学报, 2006, 40(1):53-56, 61.) [17] KACEM I, HAMMADI S, BORNE P. Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems [J]. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 2002, 32(1): 1-13. [18] KACEM I, HAMMADI S, BORNE P. Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic [J]. Mathematics and Computers in Simulation, 2002, 60(3/4/5): 245-276. [19] HO N B, TAY J C. Solving multiple-objective flexible job shop problems by evolution and local search [J]. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 2008, 38(5): 674-685. |