关键词: 混合流水车间调度, 布谷鸟算法, 解码方法, 最小化最大完工时间

Abstract:

To solve the hybrid flow-shop scheduling problem, an improved discrete cuckoo search algorithm is proposed. Aiming at the disadvantage that conventional decoding method is difficult to obtain the optimal solution, an improved decoding method is proposed, which is based on the number of workpieces and parallel machines, and assigns machines randomly according to the probability. According to the core ideas of two kinds of location update strategies of Lévy flight and brood parasitic behavior in standard cuckoo algorithm, the discrete Lévy flight based on position crossover and individual distance is proposed, and the brood parasitic strategy based on optimal insertion and optimal exchange is designed. Finally, the comparison results of the examples show that the average value of the results obtained from the discrete cuckoo algorithm based on the improved decoding method is the minimum, which verifies that the improved decoding method can generate better solutions. All the test results of the examples obtain the current optimal solutions, which verifies the superiority of the improved discrete cuckoo algorithm in solving this kind of problem.

Key words: hybrid flow-shop scheduling, cuckoo search, decoding method, minimizing makespan