Affiliation:
1. Henan University of Technology
2. Shenyang Ligong University
Abstract
A hybrid genetic algorithm based on Pareto was proposed and applied to flexible job shop scheduling problem (FJSP) with multi-objective, and the multi-objective FJSP optimization model was built, where the make-span and the machine utilization rate were concerned. The algorithm embeds Pareto ranking strategy into Pareto competition method. The operation-based encoding and an active scheduling decoding method are employed. In order to promote solution diversity, the niche technology and many kinds of crossover operations are used. Pareto filter saves the optimum individual occurring in the course of evolution, which avoids losing the optimum solutions. Three simulation experiments are carried out to illustrate that the proposed method could solve multi-objective job shop scheduling problem effectively.
Publisher
Trans Tech Publications, Ltd.
Reference6 articles.
1. Wei Wei, Tan Jianrong, Feng Yixiong. Multi-objective optimization method research on flexible job shop scheduling problem [J]. Computer Integrated Manufacturing Systems, vol. 15, 2009, pp.1592-1598. (In Chinese).
2. Cui Xunxue. Multiobjective Evolutionary Algorithms and their Applications [M]. Beijing: National Defense Industry Press, 2006. (In Chinese).
3. Byung J, Hyung R, Hyun S. A hybrid genetic algorithm for the job shop scheduling problems[J]. Computers & Industrial Engineering, vol. 45, 2003, pp.597-613.
4. Kacem I, Hammadi S, Borne P. Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems[J]. IEEE Transaction on Systems, Man, and Cybernetics, Part C: Application and Reviews, vol. 3, 2002, pp.1-13.
5. 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, vol. 60, 2002, pp.245-276.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献