基于新型蛙跳算法的带阻塞流水线调度问题

Blocking Flow Shop Based on a New Frog Leaping Algorithm

摘要: 针对目标函数为最小化Makespan的带阻塞流水线问题，提出了一种新型的蛙跳算法（New Modified Shuffled Frog Leaping Algorithm，NMSFLA）并对其求解。在蛙跳算法的局部搜索步骤中引入带约束的交叉变异思想，针对调度问题对青蛙的跳跃规则做出了改进，有效地解决了传统蛙跳算法局部搜索易出现不合法解从而导致算法效率不高的问题。仿真实验结果验证了NMSFLA解决带阻塞的Flow Shop问题的有效性。

Abstract: Abstract: For the blocking flow shop with Makespan as objective function, this paper proposes a new modified shuffled frog leaping algorithm (NMSFLA). In the local searching of FLSA, a constrained crossover method is introduced to modify the rule of frogs leaping. Thus, the problem that the local search of SFLA easily generates illegal solution may be resolved. Numerical simulation results illustrate the effectiveness of the proposed NMSFLA for blocking flow shop scheduling problem．