Please use this identifier to cite or link to this item:
|Title:||An extended Akers graphical method with a biased random-key genetic algorithm for job-shop scheduling|
|Authors:||José Fernando Gonçalves|
|Abstract:||This paper presents a local search, based on a new neighborhood for the job-shop scheduling problem, and its application within a biased random-key genetic algorithm. Schedules are constructed by decoding the chromosome supplied by the genetic algorithm with a procedure that generates active schedules. After an initial schedule is obtained, a local search heuristic, based on an extension of the 1956 graphical method of Akers, is applied to improve the solution. The new heuristic is tested on a set of 205 standard instances taken from the job-shop scheduling literature and compared with results obtained by other approaches. The new algorithm improved the best-known solution values for 57 instances.|
|Appears in Collections:||LIAAD - Indexed Articles in Journals|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.