Abstract
This research attempts to find the neighbourhood structures of the variable neighbourhood search (VNS) algorithm well fitting to job-shop scheduling problem (JSP). So as to achieve this objective, this research adapts the seven neighbourhood structures given by the travelling salesman problem’s literature to create the seven VNS algorithms for JSP. The performances of these proposed VNS algorithms are then compared to the performances of several existing algorithms, i.e., ACO, PSO and VNS algorithms taken from previously published literature. The comparison indicates that all proposed VNS algorithms perform better than the ACO and PSO algorithms with the significance level of 0.05. This paper finally reveals the neighbourhood structures performing well to JSP.
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 callMore From: International Journal of Mathematics in Operational Research
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.
