A contribution for the mixed no-idle flowshop scheduling problem with sequence-dependent setup times: analysis and solutions procedures

Detalhes bibliográficos
Autor(a) principal: Rossi, Fernando Luís
Data de Publicação: 2019
Tipo de documento: Tese
Idioma: eng
Título da fonte: Biblioteca Digital de Teses e Dissertações da USP
Texto Completo: https://www.teses.usp.br/teses/disponiveis/18/18156/tde-20052020-110437/
Resumo: In this work the mixed no-idle permutation flowshop with sequence-depdent setup times scheduling problem is approached. This production environment has not yet been studied in the literature, despite being present in the dynamics of production systems. In the no-idle flowshop environment, the machines cannot be idle and all jobs are processed uninterruptedly. Generally, the reasons are associated with economic or technological factors, where a stationary machine directly influences the performance of the production system. The no-idle flowshop is present in the manufacturing of fiberglass, production of integrated circuits, in steelworks, among others. However, assuming that all machines cannot be idle is often unrealistic. A more realistic situation would consider a mixed environment, where only a few machines perform the jobs uninterruptedly, while the other allow idleness. In this case, the environment is called mixed no-idle flowshop. In the problem extension studied in this work, setup times are considered on machines where idleness is allowed. This is the first work that addresses the mixed no-idle flow shop scheduling problem with setup times. In this Thesis, efficient heuristic methods for solving the mixed no-idle flowshop with setup times scheduling problem are proposed. To demonstrate the performance of the new methods, extensive comparisons with state-of-the-art methods from literature are performed. The results show that the proposed heuristics provide high quality solutions with computational efficiency, outperforming the methods from the literature.
id USP_40738607c82e72072bd6001bfd6ed1f6
oai_identifier_str oai:teses.usp.br:tde-20052020-110437
network_acronym_str USP
network_name_str Biblioteca Digital de Teses e Dissertações da USP
repository_id_str 2721
spelling A contribution for the mixed no-idle flowshop scheduling problem with sequence-dependent setup times: analysis and solutions proceduresUma contribuição para o problema de programação mixed no-idle flowshop com tempos de preparação dependentes da sequência: análises e métodos de soluçãoFlowshopFlowshopHeurísticasHeuristicsNo-idleNo-idleSetup TimesTempos de PreparaçãoIn this work the mixed no-idle permutation flowshop with sequence-depdent setup times scheduling problem is approached. This production environment has not yet been studied in the literature, despite being present in the dynamics of production systems. In the no-idle flowshop environment, the machines cannot be idle and all jobs are processed uninterruptedly. Generally, the reasons are associated with economic or technological factors, where a stationary machine directly influences the performance of the production system. The no-idle flowshop is present in the manufacturing of fiberglass, production of integrated circuits, in steelworks, among others. However, assuming that all machines cannot be idle is often unrealistic. A more realistic situation would consider a mixed environment, where only a few machines perform the jobs uninterruptedly, while the other allow idleness. In this case, the environment is called mixed no-idle flowshop. In the problem extension studied in this work, setup times are considered on machines where idleness is allowed. This is the first work that addresses the mixed no-idle flow shop scheduling problem with setup times. In this Thesis, efficient heuristic methods for solving the mixed no-idle flowshop with setup times scheduling problem are proposed. To demonstrate the performance of the new methods, extensive comparisons with state-of-the-art methods from literature are performed. The results show that the proposed heuristics provide high quality solutions with computational efficiency, outperforming the methods from the literature.Neste trabalho é abordado o problema de programação de produção em ambiente mixed no-idle flowshop com tempos de preparação dependente da sequência. Este ambiente de produção ainda não foi estudado na literatura, apesar de estar presente na dinâmica dos sistemas produtivos. No ambiente no-idle flowshop, as máquinas que compõem o sistema não podem ficar ociosas e todas as tarefas são executadas ininterruptamente. Geralmente os motivos são associados à fatores econômicos ou tecnológicos, onde uma máquina parada influencia diretamente o desempenho do sistema produtivo. O ambiente no-idle flowshop está presente no processamento de fibra de vidro, produção de circuitos integrados, em siderúrgicas, dentre outros. Entanto, assumir que todas as máquinas não fiquem ociosas no ambiente produtivo geralmente não é realístico. Uma situação mais realista é considerar o ambiente misto, onde apenas algumas máquinas que compõem o sistema executam as tarefas ininterruptamente, enquanto as outras permitem a ociosidade normalmente. Neste caso, o ambiente é chamado de mixed no-idle flowshop. Na extensão estudada neste trabalho, tempos de preparação que antecedem o processamento das tarefas são considerados nas máquinas em que é permitida a parada. Este é o primeiro trabalho a abordar o problema mixed no-idle flowshop com tempos de preparação. Nesta Tese, métodos heurísticos eficientes para resolução do problema mixed no-idle flowshop foram propostos. Para demonstrar a performance dos métodos desenvolvidos, foram realizadas extensas comparações com métodos considerados estado-da-arte na literatura. Os resultados mostram que as heurísticas propostas fornecem soluções de qualidade com eficiência computacional, superando os métodos da literatura.Biblioteca Digitais de Teses e Dissertações da USPNagano, Marcelo SeidoRossi, Fernando Luís2019-07-03info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/doctoralThesisapplication/pdfhttps://www.teses.usp.br/teses/disponiveis/18/18156/tde-20052020-110437/reponame:Biblioteca Digital de Teses e Dissertações da USPinstname:Universidade de São Paulo (USP)instacron:USPLiberar o conteúdo para acesso público.info:eu-repo/semantics/openAccesseng2020-05-20T21:18:02Zoai:teses.usp.br:tde-20052020-110437Biblioteca Digital de Teses e Dissertaçõeshttp://www.teses.usp.br/PUBhttp://www.teses.usp.br/cgi-bin/mtd2br.plvirginia@if.usp.br|| atendimento@aguia.usp.br||virginia@if.usp.bropendoar:27212020-05-20T21:18:02Biblioteca Digital de Teses e Dissertações da USP - Universidade de São Paulo (USP)false
dc.title.none.fl_str_mv A contribution for the mixed no-idle flowshop scheduling problem with sequence-dependent setup times: analysis and solutions procedures
Uma contribuição para o problema de programação mixed no-idle flowshop com tempos de preparação dependentes da sequência: análises e métodos de solução
title A contribution for the mixed no-idle flowshop scheduling problem with sequence-dependent setup times: analysis and solutions procedures
spellingShingle A contribution for the mixed no-idle flowshop scheduling problem with sequence-dependent setup times: analysis and solutions procedures
Rossi, Fernando Luís
Flowshop
Flowshop
Heurísticas
Heuristics
No-idle
No-idle
Setup Times
Tempos de Preparação
title_short A contribution for the mixed no-idle flowshop scheduling problem with sequence-dependent setup times: analysis and solutions procedures
title_full A contribution for the mixed no-idle flowshop scheduling problem with sequence-dependent setup times: analysis and solutions procedures
title_fullStr A contribution for the mixed no-idle flowshop scheduling problem with sequence-dependent setup times: analysis and solutions procedures
title_full_unstemmed A contribution for the mixed no-idle flowshop scheduling problem with sequence-dependent setup times: analysis and solutions procedures
title_sort A contribution for the mixed no-idle flowshop scheduling problem with sequence-dependent setup times: analysis and solutions procedures
author Rossi, Fernando Luís
author_facet Rossi, Fernando Luís
author_role author
dc.contributor.none.fl_str_mv Nagano, Marcelo Seido
dc.contributor.author.fl_str_mv Rossi, Fernando Luís
dc.subject.por.fl_str_mv Flowshop
Flowshop
Heurísticas
Heuristics
No-idle
No-idle
Setup Times
Tempos de Preparação
topic Flowshop
Flowshop
Heurísticas
Heuristics
No-idle
No-idle
Setup Times
Tempos de Preparação
description In this work the mixed no-idle permutation flowshop with sequence-depdent setup times scheduling problem is approached. This production environment has not yet been studied in the literature, despite being present in the dynamics of production systems. In the no-idle flowshop environment, the machines cannot be idle and all jobs are processed uninterruptedly. Generally, the reasons are associated with economic or technological factors, where a stationary machine directly influences the performance of the production system. The no-idle flowshop is present in the manufacturing of fiberglass, production of integrated circuits, in steelworks, among others. However, assuming that all machines cannot be idle is often unrealistic. A more realistic situation would consider a mixed environment, where only a few machines perform the jobs uninterruptedly, while the other allow idleness. In this case, the environment is called mixed no-idle flowshop. In the problem extension studied in this work, setup times are considered on machines where idleness is allowed. This is the first work that addresses the mixed no-idle flow shop scheduling problem with setup times. In this Thesis, efficient heuristic methods for solving the mixed no-idle flowshop with setup times scheduling problem are proposed. To demonstrate the performance of the new methods, extensive comparisons with state-of-the-art methods from literature are performed. The results show that the proposed heuristics provide high quality solutions with computational efficiency, outperforming the methods from the literature.
publishDate 2019
dc.date.none.fl_str_mv 2019-07-03
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/doctoralThesis
format doctoralThesis
status_str publishedVersion
dc.identifier.uri.fl_str_mv https://www.teses.usp.br/teses/disponiveis/18/18156/tde-20052020-110437/
url https://www.teses.usp.br/teses/disponiveis/18/18156/tde-20052020-110437/
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv
dc.rights.driver.fl_str_mv Liberar o conteúdo para acesso público.
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Liberar o conteúdo para acesso público.
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.coverage.none.fl_str_mv
dc.publisher.none.fl_str_mv Biblioteca Digitais de Teses e Dissertações da USP
publisher.none.fl_str_mv Biblioteca Digitais de Teses e Dissertações da USP
dc.source.none.fl_str_mv
reponame:Biblioteca Digital de Teses e Dissertações da USP
instname:Universidade de São Paulo (USP)
instacron:USP
instname_str Universidade de São Paulo (USP)
instacron_str USP
institution USP
reponame_str Biblioteca Digital de Teses e Dissertações da USP
collection Biblioteca Digital de Teses e Dissertações da USP
repository.name.fl_str_mv Biblioteca Digital de Teses e Dissertações da USP - Universidade de São Paulo (USP)
repository.mail.fl_str_mv virginia@if.usp.br|| atendimento@aguia.usp.br||virginia@if.usp.br
_version_ 1815257156886200320