关键词: 候鸟优化算法, 阻塞流水车间调度, 总流程时间

Abstract: Aiming at the blocking flow shop scheduling problem with total flow time minimization,an effective Migrating Birds Optimization (MBO) algorithm was proposed.In the proposed MBO algorithm,to guarantee the quality and diversity of the initial population,Combination of MinMax and Nawaz-Enscore-Ham(MME) algorithm was introduced to generate the leader and the neighbors of leader were regarded as the rest of population.Through the best-insert and the best-swap operator,the neighbors were constructed to easily find promising neighboring solutions.A local search procedure based on IG algorithm was added to enhance the MBO's intensification capability.To validate the performance of proposed MBO algorithm,computational experiments were conducted on the classic Taillard's benchmarks.The computational results demonstrated the effectiveness and robustness of the proposed algorithm.

Key words: migrating birds optimization, blocking flow shop scheduling, total flow time