Improved NSGA-II for the multi-objective flexible job-shop scheduling problem

Jixie Gongcheng Xuebao/Journal of Mechanical Engineering

Volumn 46, Issue 11, 2010, Pages 156-164

  Zhang, Chaoyong ^a   Dong, Xing ^a   Wang, Xiaojuan ^a   Li, Xinyu ^a   Liu, Qiong ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Analytical hierarchy process; Flexible job shop scheduling problem; Multi objective evolutionary algorithm; Non dominated sorting genetic algorithm II

Indexed keywords

ANALYTICAL HIERARCHY PROCESS; BOTTLENECK MACHINES; COMPLEX MANUFACTURING SYSTEMS; COMPROMISE SOLUTIONS; CROSSOVER AND MUTATION; FLEXIBLE JOB-SHOP SCHEDULING PROBLEM; GENERATION MECHANISM; IMPROVED NSGA-II; INITIAL SOLUTION; MAKESPAN; MEAN FLOW; MULTI OBJECTIVE; MULTI OBJECTIVE EVOLUTIONARY ALGORITHMS; NON-DOMINATED SORTING GENETIC ALGORITHMS; NSGA-II; OPTIMIZATION MODELS; PARETO SOLUTION; PRODUCTION COST; TOTAL TARDINESS;

CONVERGENCE OF NUMERICAL METHODS; DECISION THEORY; GENETIC ALGORITHMS; HIERARCHICAL SYSTEMS; MACHINE SHOPS; SCHEDULING ALGORITHMS; SORTING;

MULTIOBJECTIVE OPTIMIZATION;

EID: 77954362568     PISSN: 05776686     EISSN: None     Source Type: Journal    
DOI: 10.3901/JME.2010.11.156     Document Type: Article

References (11)

1. Garey E L, Johnson D S, Sethi R. The complexity of flowshop and job-shop scheduling[J]. Mathematics of Operations Research, 1976, 1: 117-129.
2. Wu Xiuli, Sun Shudong, Yang Zhan, et al. Survey on multi-objective flexible job shop scheduling problem [J]. Application Research of Computers, 2007, 24(3): 1-5, 9.
3. 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.
4. Crone D W, Knowles J D, Oates M J. The pareto envelope-based selection algorithm for multi-objective optimization [C] //SCHOENAUER M, DEB K, RUDOLPH G, et al. Proceedings of the Parallel Problem Solving from Nature VI Conference, Paris, France. Lecture Notes in Computer Science: Springer, 2000, 1917: 839-848.
5. Knowles J, Corne D. The Pareto archived evolution strategy: a new baseline algorithm for multiobjective optimization[C] //Proceedings of the 1999 Congress on Evolutionary Computation. Piscataway, NJ: IEEE Press, 1999: 98-105.
6. Zitzler E, Thiele L. Comparison of multiobjective evolutionary algorithms: empirical results[J]. Evolutionary Computation, 2000, 8(2): 173-195.
7. Srinivas N, Deb K. Multi-objective function optimization using non-dominated sorting genetic algorithm[J]. Evolutionary Computation. 1995, 2(3): 221-248.
8. Zheng Jinhua. Multi-Objective Evolutionary Algorithm And Application[M]. Beijing: Science Press, 2007.
9. Zhang Chaoyong, Rao Yunqing, Li Peigen, et al. An improved genetic algorithm for the job shop scheduling problem[J]. China Mechanical Engineering, 2004, 15(23): 2149-2153.
10. Kacem I, Hammadi S, Borne P. Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems[J]. IEEE Transaction Systems, Man, and Cybernetics - Part C, 2002, 32(1): 1-13.
11. Xia Weijun, Wu Zhiming. An effective hybrid optimization approach for multi-objective flexible job shop scheduling problems [J]. Computers & Industrial Engineering, 2005, 48(2): 409-425.