Heuristics methods for the flow shop scheduling problem with separated setup times
This paper deals with the permutation flow shop scheduling problem with separated machine setup times. As a result of an investigation on the problem characteristics, four heuristics methods are proposed with procedures of the construction sequencing solution by an analogy with the asymmetric travel...
| Autores: | , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2012 |
| País: | Brasil |
| Recursos: | Associação Brasileira de Engenharia de Produção (ABEPRO) |
| Repositorio: | Revista Produção Online |
| Idioma: | portugués |
| OAI Identifier: | oai:ojs.www.producaoonline.org.br:article/939 |
| Acesso em linha: | https://www.producaoonline.org.br/rpo/article/view/939 |
| Access Level: | acceso abierto |
| Palavra-chave: | Production scheduling. Permutation flow shop. Setup times. Heuristic method. Makespan Programação da produção. Flow shop permutacional. Tempos de setup. Método heurístico. Duração total da programação. |
| Resumo: | This paper deals with the permutation flow shop scheduling problem with separated machine setup times. As a result of an investigation on the problem characteristics, four heuristics methods are proposed with procedures of the construction sequencing solution by an analogy with the asymmetric traveling salesman problem with the objective of minimizing makespan. Experimental results show that one of the new heuristics methods proposed provide high quality solutions in comparisons with the evaluated methods considered in the literature. |
|---|