A hybrid evolutionary algorithm for the job shop scheduling problem

A hybrid evolutionary algorithm for the job shop scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor200917072
Country: United Kingdom
Volume: 60
Issue: 2
Start Page Number: 221
End Page Number: 235
Publication Date: Feb 2009
Journal: Journal of the Operational Research Society
Authors: , ,
Keywords: heuristics
Abstract:

In this paper, a hybrid metaheuristic method for the job shop scheduling problem is proposed. The optimization criterion is the minimization of makespan and the solution method consists of three components: a Differential Evolution–based algorithm to generate a population of initial solutions, a Variable Neighbourhood Search method and a Genetic Algorithm to improve the population; the latter two are interconnected. Computational experiments on benchmark data sets demonstrate that the proposed hybrid metaheuristic reaches high quality solutions in short computational times using fixed parameter settings.

Reviews

Required fields are marked *. Your email address will not be published.