Article ID: | iaor20062608 |
Country: | Netherlands |
Volume: | 167 |
Issue: | 1 |
Start Page Number: | 77 |
End Page Number: | 95 |
Publication Date: | Nov 2005 |
Journal: | European Journal of Operational Research |
Authors: | Gonalves Jos Fernando, Mendes Jorge Jos de Magalhes, Resende Maurcio G.C. |
Keywords: | heuristics |
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.