An effective hybrid genetic algorithm for the job shop scheduling problem

作者：Zhang Chaoyong^*; Rao Yunqing; Li Peigen

来源：International Journal of Advanced Manufacturing Technology, 2008, 39(9-10): 965-974.

DOI：10.1007/s00170-007-1354-8

• Job shop scheduling problem
• Genetic algorithm
• Crossover operator
• Local search

From the computational point of view, the job shop scheduling problem (JSP) is one of the most notoriously intractable NP-hard optimization problems. This paper applies an effective hybrid genetic algorithm for the JSP. We proposed three novel features for this algorithm to solve the JSP. Firstly, a new full active schedule (FAS) procedure based on the operation-based representation is presented to construct a schedule. After a schedule is obtained, a local search heuristic is applied to improve the solution. Secondly, a new crossover operator, called the precedence operation crossover (POX), is proposed for the operation-based representation, which can preserve the meaningful characteristics of the previous generation. Thirdly, in order to reduce the disruptive effects of genetic operators, the approach of an improved generation alteration model is introduced. The proposed approaches are tested on some standard instances and compared with other approaches. The superior results validate the effectiveness of the proposed algorithm.

• 出版日期2008-11
• 单位华中科技大学