A variable neighbourhood search algorithm for job shop scheduling problems

Authors:
Mehmet Sevkli;M. Emin Aydin
Affiliations:
Dept. of Industrial Engineering, Fatih University, Buyukcekmece, Istanbul, Turkey;Department of Computing and Information Systems, University of Luton, Luton, UK
Venue:
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Year:
2006

Citing 14
Cited 4

The shifting bottleneck procedure for job shop scheduling

Management Science
An algorithm for solving the job-shop problem

Management Science
Applying tabu search to the job-shop scheduling problem

Annals of Operations Research - Special issue on Tabu search
A genetic algorithm for the job shop problem

Computers and Operations Research - Special issue on genetic algorithms
Evolution based learning in a job shop scheduling environment

Computers and Operations Research - Special issue on genetic algorithms
A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation

Computers and Industrial Engineering
A fast taboo search algorithm for the job shop problem

Management Science
Variable neighborhood search

Computers and Operations Research
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling

Management Science
Variable neighborhood search for the degree-constrained minimum spanning tree problem

Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Comparing Object Encodings

TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Parallel GRASP with path-relinking for job shop scheduling

Parallel Computing - Special issue: Parallel computing in numerical optimization
Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem

Computers and Operations Research
A Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimisation Problems

Journal of Heuristics

A parallel hybrid implementation using genetic algorithm, GRASP and reinforcement learning

IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Exact/heuristic hybrids using rVNS and hyperheuristics for workforce scheduling

EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times

Computers and Industrial Engineering
A variable neighborhood search approach for planning and scheduling of jobs on unrelated parallel machines

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.