Abstract
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.
Highlights
Flow shop sequencing problem (FSSP) is a production planning problem
Close optimum solutions are generally found via heuristic algorithms
Some metaheuristic algorithms such as genetic algorithm [4,5], tabu search [6,7], ant colony algorithm [8] are solved by FSSP problems
Summary
Flow shop sequencing problem (FSSP) is a production planning problem. Most of the metaheuristic algorithms can be called as neighboring or local search procedures. Neighboring attitude of each metaheuristic algorithm is different. Flow shop sequencing problem minimizing the time between the beginning of perform of the first job on the first machine and the completion of perform of the last job on the last machine. Every job is processed at maximum on one machine at a time. P(i,j) processing time for job i on machine j. In the final section, obtained results of the study are assessed
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
