Abstract:

：Aiming at the flexible job shop scheduling problem with the goal of the maximum completion time, production cost and production quality, a hybrid discrete bat algorithm is proposed based on studying and analyzing the bat algorithm. In order to improve the quality of initial population of the hybrid discrete bat algorithm for solving the multi-objective flexible job shop scheduling problem, a priority assignment rule is proposed to produce initial population which improves the global searching ability of the algorithm based on the analysis of both initial machine selection and scheduling completion time of each process. At the same time, use position mutation strategy to search the optimal location as much as possible in a relatively short time, which can avoid the premature convergence effectively. The clock algorithm is proposed for the first time in the target value of the calculation problem. Commence from the concrete examples, the experimental results show that the algorithm has good performance in solving the flexible job shop scheduling problem, and it is an effective scheduling algorithm, which provides a new way to solve this kind of problems.

Key words: clock algorithm, discrete bat algorithm, optimization algorithm, the priority assignment rules, flexible job-shop scheduling