Scheduling optimization using local search and genetic algorithm
This paper presents possible ways to improve enterprises’ scheduling, simplified as Job-Shop Scheduling Problem, using heuristics. It describes proceedings through Local Search and Genetic Algorithm and includes examples of Single Swap Local Search and Genetic Algorithm with Random Keys representati...
Autor principal: | |
---|---|
Outros Autores: | , |
Formato: | article |
Idioma: | eng |
Publicado em: |
2008
|
Assuntos: | |
Texto completo: | http://hdl.handle.net/1822/19095 |
País: | Portugal |
Oai: | oai:repositorium.sdum.uminho.pt:1822/19095 |
Resumo: | This paper presents possible ways to improve enterprises’ scheduling, simplified as Job-Shop Scheduling Problem, using heuristics. It describes proceedings through Local Search and Genetic Algorithm and includes examples of Single Swap Local Search and Genetic Algorithm with Random Keys representation and chromosome correction. The paper also includes a comparison of makespan improvements existing in the Local Search and in the Genetic Algorithm. |
---|