摘要

To solve the blocking flow shop scheduling with maximum completion time (i.e. makespan) criterion, we proposed an Improved biogeography-based optimization algorithm (IBBO). The framework of basic BBO algorithm is used in the IBBO algorithm, and the introduction of the NEH algorithm make IBBO algorithm with certain quality and diversity. The migration operation based on the insert rules and the mutation operation based on swap rules are presented to avoid the occurrence of illegal solution of the blocking flow shop problem. An insert-neighborhood search algorithm was used to strengthen the local search ability of the IBBO. The computational results show the effectiveness of the proposed IBBO algorithm in solving the blocking flow shop scheduling with maximum completion time criterion.