Abstract
Variable Neighborhood Search (VNS) is one of the most recent metaheuristics used for problem solving in which a systematic change of neighborhood within a local search is carried out. The idea is to build the best local search and shake operations based on neighbourhood structure available. In this paper, a modified version of VNS algorithm proposed for identical parallel machines scheduling problems with the objective function of minimizing makespan. The proposed VNS algorithm was tested 150 randomly generated problems with different jobs and machines. The results gained by modified VNS (MVNS) algorithm are presented and compared with the both Genetic Algorithm (GA) and Longest Processing Time (LPT) solutions. It is concluded that the MVNS algorithms outperform the both GA and LPT.
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.
