Um algoritmo híbrido busca tabu/ILS para o problema de sequenciamento da produção em ambiente open shop
The open shop scheduling problem is a production environment in which the jobs are processed in m machines where all the machines can process any of the n jobs and each machine presents a specific processing time for a given job. Since the OSSP is NP-complete, a tabu search/iterated local search (IL...
| Autores: | , |
|---|---|
| Tipo de documento: | artigo |
| Estado: | Versão publicada |
| Data de publicação: | 2021 |
| País: | Brasil |
| Recursos: | Universidade Federal do Ceará (UFC) |
| Repositório: | Repositório Institucional da Universidade Federal do Ceará (UFC) |
| Idioma: | português |
| OAI Identifier: | oai:repositorio.ufc.br:riufc/68297 |
| Acesso em linha: | http://www.repositorio.ufc.br/handle/riufc/68297 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Programação da produção Meta-Heurísticas Otimização combinatória |
| Resumo: | The open shop scheduling problem is a production environment in which the jobs are processed in m machines where all the machines can process any of the n jobs and each machine presents a specific processing time for a given job. Since the OSSP is NP-complete, a tabu search/iterated local search (ILS) metaheuristic is proposed. We carried out computational experiments on 140 literature problem instances in order to test the performance of the proposed algorithm. The well-known priority rules LPT, SPT, LAPT and LTRPOM were evaluated as the initial solution for the proposed meta-heuristic. The objective function adopted was minimizing the makespan, and we used the relative deviation as performance criteria. Computational results point to a very well performance of the proposed meta-heuristic for the tested instances. |
|---|