Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/35200| Título: | A genetic algorithm with a quasi-local search for the job shop problem with recirculation |
| Autor(es): | Oliveira, José A. |
| Palavras-chave: | Metaheuristics Job shop scheduling Genetic algorithm metahcuristics |
| Data: | 2006 |
| Editora: | Springer |
| Revista: | Advances in Soft Computing |
| Citação: | Oliveira, J. A. (2006). A genetic algorithm with a quasi-local search for the job shop problem with recirculation. In Applied Soft Computing Technologies: The Challenge of Complexity. Advances in Soft Computing, Volume 34, pp. 221-234. Springer Berlin Heidelberg. |
| Resumo(s): | In this work we present a genetic algorithm for the job shop problem with recirculation. The genetic algorithm includes a local search procedure that is implemented as a genetic operator. This strategy differs from the memetic algorithm because it is not guaranteed that the local minimum is achieved in each iteration. This algorithm performs well with classical JSP and can be applied to the JSP with recirculation. The genetic algorithm includes specific knowledge of the problem to improve its efficiency. We test the algorithm by using some benchmark problems and present computational results. |
| Tipo: | Artigo em ata de conferência |
| URI: | https://hdl.handle.net/1822/35200 |
| ISBN: | 978-3-540-31649-7 |
| DOI: | 10.1007/3-540-31662-0_18 |
| ISSN: | 1615-3871 |
| Versão da editora: | http://www.springerlink.com/content/4v5765t231g50363 |
| Arbitragem científica: | yes |
| Acesso: | Acesso restrito UMinho |
| Aparece nas coleções: |
Ficheiros deste registo:
| Ficheiro | Descrição | Tamanho | Formato | |
|---|---|---|---|---|
| art2006_Springer.pdf Acesso restrito! | 179,98 kB | Adobe PDF | Ver/Abrir |
