期刊
COMPUTERS & OPERATIONS RESEARCH
卷 39, 期 10, 页码 2291-2299出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2011.12.005
关键词
Genetic algorithm; Job shop scheduling problem; Crossover operator; Mutation operator; Local search
类别
资金
- National Natural Science Foundation of China [60873099]
- Ph.D. Programs Foundation of Ministry of Education of China [20090203110005]
Job shop scheduling problem is a typical NP-hard problem. To solve the job shop scheduling problem more effectively, some genetic operators were designed in this paper. In order to increase the diversity of the population, a mixed selection operator based on the fitness value and the concentration value was given. To make full use of the characteristics of the problem itself, new crossover operator based on the machine and mutation operator based on the critical path were specifically designed. To find the critical path, a new algorithm to find the critical path from schedule was presented. Furthermore, a local search operator was designed, which can improve the local search ability of GA greatly. Based on all these, a hybrid genetic algorithm was proposed and its convergence was proved. The computer simulations were made on a set of benchmark problems and the results demonstrated the effectiveness of the proposed algorithm. (C) 2011 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据