A proposal simulated annealing algorithm for proportional parallel flow shops with separated setup times
This article addresses the problem of minimizing makespan on two parallel flow shops with proportional processing and setup times. The setup times are separated and sequence-independent. The parallel flow shop scheduling problem is a specific case of well-known hybrid flow shop, characterized by a m...
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2014 |
| País: | Brasil |
| Institución: | 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/1631 |
| Acceso en línea: | https://www.producaoonline.org.br/rpo/article/view/1631 |
| Access Level: | acceso abierto |
| Palabra clave: | Scheduling. Parallel flow shops. Simulated annealing. Setup times. Programação da produção. Flow shops paralelos. Simulated annealing. Tempos de setup. |
| Sumario: | This article addresses the problem of minimizing makespan on two parallel flow shops with proportional processing and setup times. The setup times are separated and sequence-independent. The parallel flow shop scheduling problem is a specific case of well-known hybrid flow shop, characterized by a multistage production system with more than one machine working in parallel at each stage. This situation is very common in various kinds of companies like chemical, electronics, automotive, pharmaceutical and food industries. This work aimed to propose six Simulated Annealing algorithms, their perturbation schemes and an algorithm for initial sequence generation. This study can be classified as “applied research” regarding the nature, “exploratory” about the objectives and “experimental” as to procedures, besides the “quantitative” approach. The proposed algorithms were effective regarding the solution and computationally efficient. Results of Analysis of Variance (ANOVA) revealed no significant difference between the schemes in terms of makespan. It’s suggested the use of PS4 scheme, which moves a subsequence of jobs, for providing the best percentage of success. It was also found that there is a significant difference between the results of the algorithms for each value of the proportionality factor of the processing and setup times of flow shops. |
|---|