doi: 10.4304/jsw.1.2.34-39
Variable Neighbourhood Search for Job Shop Scheduling Problems
- 1 Operation Research Department, Defense Sciences Institute, Turkish Military Academy 06654, Cankaya, Ankara
- 2 University of Bedfordshire, Dept. of Computing and Information Systems Luton, UK
Abstract
Variable Neighbourhood Search (VNS) is one ofthe most recent metaheuristics used for problem solving inwhich a systematic change of neighbourhood within a localsearch is carried out. In this paper, an investigation onimplementing VNS for job shop scheduling problems iscarried out tackling benchmark suites collected from ORlibrary. The idea is to build the best local search and shakeoperations based on neighbourhood structure available. Theresults are presented and compared with the recentapproaches in the literature. It is concluded that the VNSalgorithm can generally find better results.
Keywords
- variable neighbourhood search
- job shops
How to Cite
Mehmet Sevkli and M. Emin Aydin, "Variable Neighbourhood Search for Job Shop Scheduling Problems," Journal of Software, vol. 1, no. 2, pp. 34-39, 2006. https://doi.org/ 10.4304/jsw.1.2.34-39
Copyright & License
Copyright © 2006 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).