Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling

Abstract EN

A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP).

Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem.

Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases.

An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance.

Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem.