A Discrete Migrating Birds Optimization Algorithm for Permutation Flow Shop Scheduling Problem

In this work,a discrete migrating birds optimization (DMBO) scheduling algorithm is proposed for permutation flow shop scheduling problem (PFSP) with the objective of minimizing maximum completion time (i.e. makespan).In order to guarantee the quality and diversity of the flock, NEH is employed to yield a feasible solution and the others are generated randomly in DMBO algorithm.The flock are arranged in the reversed hypothetical V formation according to the ascending order of optimization value.The leader is evolved from the neighbor solutions which are generated by optimizing insertion and swap operators.Meanwhile,the other birds in the flock are evolved by their neighbor solutions generated by hybrid-strategy and the unused better neighbor solutions of the previous generated by hybrid-strategy individuals.This evolution mechanism is unique for migrating birds optimization algorithm.Furthermore,a local search procedure is performed on every individual.Finally,an orthogonal design method is employed in experiment to regulate the parameters of DMBO.By testing the Car and Rec benchmarks,it is shown that the proposed DMBO algorithm is effective in the performance.