Hybrid algorithm of shuffled frog-leaping algorithm and particle swarm optimization algorithm for lot-streaming no-wait scheduling problem
批量无等待调度问题的微粒群蛙跳混合优化算法*

This paper proposed the effective hybrid algorithm of particle swarm optimization (PSO)algorithm and shuffled frog-leaping algorithm (SFLA) for solving the lot-streaming flow shop scheduling problem with the criterion of minimizing maximum completion time (i.e., makespan) under no-wait production cases. Combining the strong global convergence of particle swarm optimization algorithm and the depth search of the shuffled frog-leaping algorithm, proposed three hybrid algorithms, which could balance local convergence and depth search ability. The computational results and comparisons show that the proposed hybrid algorithms are effective and efficient for random instants in finding better solutions for the problem considered.