Migrating Birds Optimization for Flow Shop Sequencing Problem

摘要

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