A Variable Neighbourhood Search Algorithm for Job Shop Scheduling Problems
Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for solving combinatorial optimization problems in which a systematic change of neighbourhood within a local search is carried out. In this paper, a variable neighbourhood search algorithm is proposed for Job Shop Scheduling (JSS) problem with makespan criterion. The results gained by VNS algorithm are presented and compared with the best known results in literature. It is concluded that the VNS implementation is better than many recently published works with respect to the quality of the solution.
KeywordsLocal Search Completion Time Neighbourhood Structure Greedy Randomize Adaptive Search Procedure Hybrid Genetic Algorithm
Unable to display preview. Download preview PDF.
- 6.Beasley, J.E.: Obtaining Test Problems via Internet. Journal of Global Optimisation 8, 429-433, http://people.brunel.ac.uk/~mastjjb/jeb/info.html
- 14.Dorndorf, U., Pesch, E.: Evolution Based Learning in a Job Shop Scheduling Environment. Computers & Operations Research 22 (1995); 0:30 International Journal of Production Research. A hybrid PSO for the JSSP (June 26, 2005)Google Scholar