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

摘要： 针对零空闲流水线调度问题，以E/T指标最优为优化测度，提出了一种蛙跳求解算法。首先，该算法采用新的个体产生方法，扩展传统蛙跳算法的求解模型。其次，使用带有启发式策略的种群初始化方法优化初始解性能。再次，借助基于种群多样性的方法进行排序和分组，并通过部分随机初始化策略保持种群多样性。最后，结合一种简单而有效的邻域搜索算法，达到局部探索和全局搜索之间的平衡，进而提高收敛速度。在若干benchmark问题上的仿真实验表明了所提算法的有效性。

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