A Hybrid Genetic Algorithm for the Job Shop Scheduling Problem

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...

ver descrição completa

Detalhes bibliográficos
Autor principal: Gonçalves, José Fernando (author)
Outros Autores: Mendes, J. J. M. (author), Resende, Maurício G. C. (author)
Formato: article
Idioma:eng
Publicado em: 2017
Assuntos:
Job Shop
Scheduling
Genetic Algorithm
Heuristics
Random Keys
Texto completo:http://hdl.handle.net/10400.22/10058
País:Portugal
Oai:oai:recipp.ipp.pt:10400.22/10058

Texto Completo

http://hdl.handle.net/10400.22/10058

Registros relacionados