关键词: 批量流水线, 调度, 蛙跳算法, 模拟退火, 插入邻域搜索, 数学模型

Abstract: The lot-streaming flow shop scheduling problem to minimize the total Earliness / Tardiness(E/T）penalty was studied. According to the principle of frog-leaping algorithm, a novel allocation function was designed by adopting sequence-based coding method and two-point crossover operator. Then, a novel discrete Shuffled Frog-Leaping Algorithm(SFLA)was put forward to solve the problem. To further enhance development capability and efficiency of the algorithm, the proposed SFLA was improved with perturbation tactic, simulated annealing acceptance criteria and inserting neighborhood search. Extensive experiments based on the randomly generated instances were conducted. Computational results and comparison verified the effectiveness of the proposed algorithm.

Key words: lot-streaming flow shop, scheduling, shuffled frog-leaping algorithm, simulated annealing, insert neighborhood search, mathematical models