A proposal simulated annealing algorithm for proportional parallel flow shops with separated setup times

Detalhes bibliográficos
Autor(a) principal: Fuchigami, Helio Yochihiro
Data de Publicação: 2014
Tipo de documento: Artigo
Idioma: por
Título da fonte: Revista Produção Online
Texto Completo: https://www.producaoonline.org.br/rpo/article/view/1631
Resumo: 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.
id ABEPRO-2_ab15f949558c28a0195498f28d4d6700
oai_identifier_str oai:ojs.emnuvens.com.br:article/1631
network_acronym_str ABEPRO-2
network_name_str Revista Produção Online
repository_id_str
spelling A proposal simulated annealing algorithm for proportional parallel flow shops with separated setup timesProposição de algoritmo simulated annealing para programação em flow shops paralelos proporcionais com tempos de setup explícitosScheduling. Parallel flow shops. Simulated annealing. Setup times.Programação da produção. Flow shops paralelos. Simulated annealing. Tempos de setup.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.Este trabalho aborda o problema de otimização da duração total da programação (makespan) em dois flow shops paralelos proporcionais com tempos de setup explícitos e independentes da sequência de tarefas. O problema de programação em flow shops paralelos é um caso específico do conhecido flow shop híbrido, caracterizado por sistemas produtivos multiestágio com mais de uma máquina operando em paralelo em cada estágio, e muito frequente em vários tipos de indústrias como química, eletrônica, automotiva, farmacêutica e alimentícia. Este trabalho objetivou propor seis algoritmos Simulated Annealing e seus respectivos esquemas de perturbação, além de um algoritmo para geração da sequência inicial, para solução do problema descrito. Este estudo pode ser classificado como “pesquisa aplicada” quanto à natureza, “pesquisa exploratória” quanto aos objetivos e “pesquisa experimental” quanto aos procedimentos, além da abordagem “quantitativa”. Os algoritmos propostos mostraram-se eficazes quanto a solução e eficientes computacionalmente. Os resultados da Análise de Variância (ANOVA) revelaram que não existe diferença significativa entre os esquemas de perturbação em termos do makespan. Sugere-se a utilização do esquema PS4, que faz o deslocamento de uma subsequência de tarefas, por ter fornecido a melhor porcentagem de sucesso. Verificou-se também que é significativa a diferença entre os resultados dos algoritmos para cada valor do fator de proporcionalidade dos tempos de processamento e de setup dos flow shops.Associação Brasileira de Engenharia de Produção2014-08-18info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfvideo/mp4https://www.producaoonline.org.br/rpo/article/view/163110.14488/1676-1901.v14i3.1631Revista Produção Online; Vol. 14 No. 3 (2014); 997-1023Revista Produção Online; v. 14 n. 3 (2014); 997-10231676-1901reponame:Revista Produção Onlineinstname:Associação Brasileira de Engenharia de Produção (ABEPRO)instacron:ABEPROporhttps://www.producaoonline.org.br/rpo/article/view/1631/1191https://www.producaoonline.org.br/rpo/article/view/1631/1190Copyright (c) 2014 Revista Produção Onlineinfo:eu-repo/semantics/openAccessFuchigami, Helio Yochihiro2015-11-11T17:25:34Zoai:ojs.emnuvens.com.br:article/1631Revistahttp://producaoonline.org.br/rpoPUBhttps://www.producaoonline.org.br/rpo/oai||producaoonline@gmail.com1676-19011676-1901opendoar:2015-11-11T17:25:34Revista Produção Online - Associação Brasileira de Engenharia de Produção (ABEPRO)false
dc.title.none.fl_str_mv A proposal simulated annealing algorithm for proportional parallel flow shops with separated setup times
Proposição de algoritmo simulated annealing para programação em flow shops paralelos proporcionais com tempos de setup explícitos
title A proposal simulated annealing algorithm for proportional parallel flow shops with separated setup times
spellingShingle A proposal simulated annealing algorithm for proportional parallel flow shops with separated setup times
Fuchigami, Helio Yochihiro
Scheduling. Parallel flow shops. Simulated annealing. Setup times.
Programação da produção. Flow shops paralelos. Simulated annealing. Tempos de setup.
title_short A proposal simulated annealing algorithm for proportional parallel flow shops with separated setup times
title_full A proposal simulated annealing algorithm for proportional parallel flow shops with separated setup times
title_fullStr A proposal simulated annealing algorithm for proportional parallel flow shops with separated setup times
title_full_unstemmed A proposal simulated annealing algorithm for proportional parallel flow shops with separated setup times
title_sort A proposal simulated annealing algorithm for proportional parallel flow shops with separated setup times
author Fuchigami, Helio Yochihiro
author_facet Fuchigami, Helio Yochihiro
author_role author
dc.contributor.author.fl_str_mv Fuchigami, Helio Yochihiro
dc.subject.por.fl_str_mv Scheduling. Parallel flow shops. Simulated annealing. Setup times.
Programação da produção. Flow shops paralelos. Simulated annealing. Tempos de setup.
topic Scheduling. Parallel flow shops. Simulated annealing. Setup times.
Programação da produção. Flow shops paralelos. Simulated annealing. Tempos de setup.
description 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.
publishDate 2014
dc.date.none.fl_str_mv 2014-08-18
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv https://www.producaoonline.org.br/rpo/article/view/1631
10.14488/1676-1901.v14i3.1631
url https://www.producaoonline.org.br/rpo/article/view/1631
identifier_str_mv 10.14488/1676-1901.v14i3.1631
dc.language.iso.fl_str_mv por
language por
dc.relation.none.fl_str_mv https://www.producaoonline.org.br/rpo/article/view/1631/1191
https://www.producaoonline.org.br/rpo/article/view/1631/1190
dc.rights.driver.fl_str_mv Copyright (c) 2014 Revista Produção Online
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Copyright (c) 2014 Revista Produção Online
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
video/mp4
dc.publisher.none.fl_str_mv Associação Brasileira de Engenharia de Produção
publisher.none.fl_str_mv Associação Brasileira de Engenharia de Produção
dc.source.none.fl_str_mv Revista Produção Online; Vol. 14 No. 3 (2014); 997-1023
Revista Produção Online; v. 14 n. 3 (2014); 997-1023
1676-1901
reponame:Revista Produção Online
instname:Associação Brasileira de Engenharia de Produção (ABEPRO)
instacron:ABEPRO
instname_str Associação Brasileira de Engenharia de Produção (ABEPRO)
instacron_str ABEPRO
institution ABEPRO
reponame_str Revista Produção Online
collection Revista Produção Online
repository.name.fl_str_mv Revista Produção Online - Associação Brasileira de Engenharia de Produção (ABEPRO)
repository.mail.fl_str_mv ||producaoonline@gmail.com
_version_ 1761536949326184448