关键词: 流水车间调度, 有限缓冲区, Memetic算法

Abstract: Aiming at the flow shop scheduling problem with limited buffers,a Memetic algorithm based on Variable Neighborhood Search (VNS) strategy was proposed.To guarantee the quality of initial population,NEH algorithm and improved IG algorithm were used to generate some initial individuals,and partial crossover and insert mutation operators were used to design an improved VNS algorithm which could conduct the local search.In this algorithm,SA was taken as the local method to enhance the search capability of the algorithm.Thus Memetic algorithm obtained a balance between the exploration and exploitation.The computational experiments and comparisons were conducted to solve on the classic benchmark problems,and the computational results demonstrated the effectiveness of the proposed algorithm.

Key words: flow shop scheduling, limited buffer, Memetic algorithm