Abstract (EN):
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.
Language:
English
Type (Professor's evaluation):
Scientific
Contact:
jfgoncal@fep.up.pt; jjm@isep.ipp.pt; mgcred@research.att.com
No. of pages:
19