Blocking Flow Shop Based on a New Frog Leaping Algorithm

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．