Abstract
A discrete artificial bee colony algorithm (DABC) is proposed for solving the permutation flow shop scheduling problem (PFSSP) with minimum makespan criterion. Firstly, the NEH heuristic was combined the random initialization to the population for quality and diversity. Secondly, a new individual enhancement scheme is proposed to combine the swap, insert, inverse and adjacent exchange operation. Third, the fast local search is used to enhancing the individuals. Fourth, the pair-wise based local search is used to enhance the global optimal solution and escape from local minimum. Lastly, simulations and comparisons based on PFSSP benchmarks are carried out, which show that our algorithm is effectively and efficiently for solving the PFSSP.
Sign-in/Register to access full text options 
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.
