A hybrid genetic algorithm for the job shop scheduling problem

J. F. Gonçalves,  J. J. M. Mendes, and M.G.C. Resende

European J. of Operational Research, vol.167, pp.77-95, 2005.


This paper presents a hybrid genetic algorithm for the Job Shop Scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a priority rule in which the priorities are defined by the genetic algorithm. Schedules are constructed using a procedure that generates parameterized active schedules. After a schedule is obtained a local search heuristic is applied to improve the solution. The approach is tested on a set of standard instances taken from the literature and compared with other approaches. The computation results validate the effectiveness of the proposed algorithm.

PDF file of full paper

Go back
Mauricio G.C. Resende's Home Page
Last modified: 23 February 2005

Copyright Notice