Uma nova heurística para o problema de minimização de trocas de ferramentas
The minimization of tool switches problem (MTSP) seeks a sequence to process a set of jobs so that the number of tool switches required is minimized. This study presents a new heuristic for the MTSP. This heuristic has two phases: a constructive phase, based on a graph where the vertices correspond...
| Autores: | , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2012 |
| País: | Brasil |
| Recursos: | Universidade Federal de São Paulo (UNIFESP) |
| Repositorio: | Repositório Institucional da UNIFESP |
| Idioma: | portugués |
| OAI Identifier: | oai:repositorio.unifesp.br:11600/6831 |
| Acesso em linha: | http://dx.doi.org/10.1590/S0104-530X2012000100002 http://repositorio.unifesp.br/handle/11600/6831 |
| Access Level: | acceso abierto |
| Palavra-chave: | Scheduling Tool switches Heuristic Graph Metaheuristic Sequenciamento Troca de ferramentas Heurística Grafo Meta-heurísticas |
| Resumo: | The minimization of tool switches problem (MTSP) seeks a sequence to process a set of jobs so that the number of tool switches required is minimized. This study presents a new heuristic for the MTSP. This heuristic has two phases: a constructive phase, based on a graph where the vertices correspond to tools and there is an arc k = (i, j) linking vertices i and j if and only if the tools i and j are required to execute some job; and an improvement phase, based on an Iterated Local Search. Computational results show that the proposed heuristic has a good performance on the instances tested contributing to a significant reduction in the number of nodes generated by an enumerative algorithm. |
|---|