Abstract
The permutation flow-shop scheduling problem (PFSP) is an non-deterministic polynomialtime (NP) hard combinatorial optimization problems and has been widely researched within thescheduling community. In this paper, a memetic gravitation search algorithm (MGSA) is proposedto solve the PFSP for minimizing the makespan measure. The smallest position value (SPV) rule isutilized for converting the continuous number to job permutations for determining the most suitablethe proposed MGSA for the PFSP. The proposed MGSA uses a Nawaz-Enscore-Ham (NEH) heuristicalgorithm for initialization of population, and a simulated annealing (SA) is coupled with the variableneighborhood search (VNS) as the local search method to balance exploitation and exploration. Toverify the robustness of the MGSA, it is compared with three particle swarm optimization (PSO) algorithmson the basis of 12 PFSP instances with different job sizes ranging from 20 to 500. The resultsdemonstrate that the proposed MGSA can outperform other compared algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.