Abstract

This paper presents a Dynamic Multi-Swarm Particle Swarm Optimizer (DMS-PSO) for solving blocking flow shop scheduling problems with makespan criterion. Using small swarms and a regrouping schedule, DMS-PSO has a better global search ability. In order to improve its local search ability, a special designed local search phase is added into the algorithm. The experimental results indicate that the proposed DMS-PSO has a better performance on the blocking flow shop scheduling problems comparing some other algorithms.

Full Text

Published Version

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 call

Disclaimer: 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.