关键词: 两段式狼群算法, 柔性作业车间调度, 最大完工时间

Abstract:

Aiming at the flexible job shop scheduling problem with the objective function of minimizing the maximum completion time, a two-stage wolf swarm algorithm is proposed. In order to ensure the quality of the initial solution, the two-vector code coding method is used to design the initialization population. By redesigning the walk behavior, call behavior and siege behavior in the original wolf swarm algorithm, the problem that the original wolf swarm algorithm is easy to fall into local optimum is solved. Then the distance decision factor in the original wolf swarm algorithm is abandoned to reduce the complexity of the algorithm. Finally, the simulation test and algorithm comparison of two examples in the workshop show the effectiveness of the proposed algorithm to solve the problem, and provide a more effective method for solving the flexible job shop scheduling problem.

Key words: two-vector wolf pack algorithm, flexible job shop scheduling, makespan