关键词: 蛙跳算法, 零空闲流水线调度, 邻域搜索, 种群多样性

Abstract: A Shuffled Frog Leaping Algorithm（SFLA） is proposed to solve the No_Idle permutation Flow Shop（NIFS） scheduling problems with minimum of the penalties of the E/T criteria.First，the algorithm adopts a new method of individual production to extend the traditional model of SFLA.Second，it uses heuristic method to construct the initial solution.Third，it applies new sorting way based on the diversity of the population and some restart mechanism to avoid loosing diversity.Last，a simple but effective local search algorithm is developed to incorporate into the SFLA to stress the balance between global exploration and local exploitation，and to improve the speed of convergence.The algorithm employs the simple neighborhood search to improve the speed of convergence.The experimental results show that the proposed algorithm is effective and efficient for different scale benchmarks of NIFS.

Key words: shuffled frog leaping algorithm, no_idle permutation flow shop, neighborhood search, population diversity