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

Abstract:  This paper proposed an effective MBO algorithm to minimize the total flowtime in a blocking flow shop.In the proposed MBO algorithm,in order to guarantee the quality and diversity of the initial population,MEE algorithm is introduced to generate the leader and the neighbors of the leader are regarded as the rest of the population.The neighbors are constructed through best-insert + best-swap operator for the leader and the following birds to easily find promising neighboring solutions.Furthermore,a local search procedure based on IG algorithm is added to enhance the MBO’s intensification capability.To validate the performance of the proposed MBO algorithm,computational experiments were conducted on the well-known Taillard’s benchmarks.The computational results demonstrate the effectiveness and robustness of the proposed algorithm.

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