Migrating Birds Optimization for Flow Shop Sequencing Problem

Abstract

FSSP is a typical NP-Hard problem which is\rdesired to be minimum makespan. This study consid- ers Migrating Birds\rOptimization (MBO) which is metaheuristic approach for the solution of Flow\rShop Sequencing Problem (FSSP). As the basic MBO algorithm is designed for\rdiscrete problems. The performance of basic MBO algorithm is tested via some\rFSSP data sets exist in literature. Obtained results are compared with\roptimal results of related data sets.