| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 307.74 KB | Adobe PDF |
Orientador(es)
Resumo(s)
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.
Descrição
Palavras-chave
Job Shop Scheduling Genetic Algorithm Heuristics Random Keys
Contexto Educativo
Citação
Editora
Elsevier