Optimization approaches for integrating cutting stock and flow shop scheduling with setup times in automotive chassis manufacturing

Detalhes bibliográficos
Ano de defesa: 2025
Autor(a) principal: Souza, Raínne Florisbelo Gonçalves de
Orientador(a): Não Informado pela instituição
Banca de defesa: Não Informado pela instituição
Tipo de documento: Tese
Tipo de acesso: Acesso aberto
Idioma: eng
Instituição de defesa: Biblioteca Digitais de Teses e Dissertações da USP
Programa de Pós-Graduação: Não Informado pela instituição
Departamento: Não Informado pela instituição
País: Não Informado pela instituição
Palavras-chave em Português:
corte de estoque
cutting stock
flow shop
flow shop scheduling
integrated scheduling
mathematical modeling
modelagem matemática
problemas integrados
sequence-dependent setup times
setup dependente da sequência
Link de acesso: https://www.teses.usp.br/teses/disponiveis/18/18156/tde-04042025-074450/
Resumo: With the growing competitiveness in the market, industries are seeking ways to differentiate themselves and reduce production costs to increase profits. This has led many researchers to focus on studying integrated problems, as various aspects within an industrial setting are interconnected and can impact the overall production costs. This research specifically studies an integrated problem of cutting stock and permutation flow shop scheduling with sequence-dependent setup times found in the automotive industry as it is an unexplored area. The cutting stock process is responsible for providing the items required in production. Only when items are available, the flow shop production can be initiated. Besides that, there are sequence-dependent setup times between jobs to be processed on machines. Studying the integrated problem may improve the efficiency of the whole process. This thesis provides an understanding of the problem and its relevance in practical scenarios. A mixed integer linear programming is proposed as well as exact and heuristic resolution methods. For computational experiments, some instances were generated and the proposed methods were compared with one another. Results showed that the proposed exact method yielded quality solutions for small instances and the usage of a method to provide a good feasible initial solution may enhance the results. Furthermore, the proposed heuristic method based on the Adaptive Large Neighborhood Search (ALNS) algorithm outperformed the other tested methods, validating its quality and efficiency
id USP_7f6041fdd555692486a95c467956b4df
oai_identifier_str oai:teses.usp.br:tde-04042025-074450
network_acronym_str USP
network_name_str Biblioteca Digital de Teses e Dissertações da USP
repository_id_str
spelling Optimization approaches for integrating cutting stock and flow shop scheduling with setup times in automotive chassis manufacturingAbordagens de otimização para o problema integrado de corte de estoque e flow shop com tempos de setup dependente da sequência em uma indústria de fabricação de chassi de automóveiscorte de estoquecutting stockflow shopflow shop schedulingintegrated schedulingmathematical modelingmodelagem matemáticaproblemas integradossequence-dependent setup timessetup dependente da sequênciaWith the growing competitiveness in the market, industries are seeking ways to differentiate themselves and reduce production costs to increase profits. This has led many researchers to focus on studying integrated problems, as various aspects within an industrial setting are interconnected and can impact the overall production costs. This research specifically studies an integrated problem of cutting stock and permutation flow shop scheduling with sequence-dependent setup times found in the automotive industry as it is an unexplored area. The cutting stock process is responsible for providing the items required in production. Only when items are available, the flow shop production can be initiated. Besides that, there are sequence-dependent setup times between jobs to be processed on machines. Studying the integrated problem may improve the efficiency of the whole process. This thesis provides an understanding of the problem and its relevance in practical scenarios. A mixed integer linear programming is proposed as well as exact and heuristic resolution methods. For computational experiments, some instances were generated and the proposed methods were compared with one another. Results showed that the proposed exact method yielded quality solutions for small instances and the usage of a method to provide a good feasible initial solution may enhance the results. Furthermore, the proposed heuristic method based on the Adaptive Large Neighborhood Search (ALNS) algorithm outperformed the other tested methods, validating its quality and efficiencyCom a competitividade de mercado, as indústrias têm procurado meios para se destacar, além de pesquisar por estratégias para reduzir os custos de produção contribuindo, assim, para um aumento do retorno financeiro. Com isso, o estudo de problemas integrados tem aumentado na literatura, visto que, em um ambiente fabril, diferentes setores estão interligados e influenciam diretamente no custo e tempo de entrega do produto final. Nesta pesquisa, é estudado o problema integrado de corte de estoque e flow shop com tempos de setup dependentes da sequência que aparece em uma fábrica de chassi de automóveis. Trata-se de um problema ainda não explorado na literatura. O processo de corte é responsável por fornecer os itens demandados para produção. Apenas quando estes itens estão disponíveis é que a produção pode iniciar. Além disso, para a execução das tarefas nas máquinas, existe um tempo de setup dependente da sequência. O estudo da integração das áreas dentro de uma fábrica permite encontrar uma solução comum capaz de melhorar a eficiência de todo o processo. Nesta tese, é estudado o problema e sua relevância em cenários práticos. Uma formulação linear inteira mista é proposta para o problema, assim como métodos exatos e heurísticos de resolução. Para os testes computacionais, algumas instâncias foram geradas e os métodos propostos foram comparados entre eles. Os resultados mostraram que o método exato proposto obteve soluções de qualidade para instâncias pequenas e que o uso de um método capaz de gerar uma boa solução inicial factível auxilia na melhora da qualidade dos resultados. Além disso, o método heurísticos proposto com base no algoritmo Adaptive Large Neighborhood Search (ALNS) obteve melhores resultados, quando comparado aos outros métodos testados, validando sua qualidade e eficiência.Biblioteca Digitais de Teses e Dissertações da USPNagano, Marcelo SeidoSouza, Raínne Florisbelo Gonçalves de2025-01-27info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/doctoralThesisapplication/pdfhttps://www.teses.usp.br/teses/disponiveis/18/18156/tde-04042025-074450/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/openAccesseng2025-04-04T20:43:02Zoai:teses.usp.br:tde-04042025-074450Biblioteca 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:27212025-04-04T20:43:02Biblioteca Digital de Teses e Dissertações da USP - Universidade de São Paulo (USP)false
dc.title.none.fl_str_mv Optimization approaches for integrating cutting stock and flow shop scheduling with setup times in automotive chassis manufacturing
Abordagens de otimização para o problema integrado de corte de estoque e flow shop com tempos de setup dependente da sequência em uma indústria de fabricação de chassi de automóveis
title Optimization approaches for integrating cutting stock and flow shop scheduling with setup times in automotive chassis manufacturing
spellingShingle Optimization approaches for integrating cutting stock and flow shop scheduling with setup times in automotive chassis manufacturing
Souza, Raínne Florisbelo Gonçalves de
corte de estoque
cutting stock
flow shop
flow shop scheduling
integrated scheduling
mathematical modeling
modelagem matemática
problemas integrados
sequence-dependent setup times
setup dependente da sequência
title_short Optimization approaches for integrating cutting stock and flow shop scheduling with setup times in automotive chassis manufacturing
title_full Optimization approaches for integrating cutting stock and flow shop scheduling with setup times in automotive chassis manufacturing
title_fullStr Optimization approaches for integrating cutting stock and flow shop scheduling with setup times in automotive chassis manufacturing
title_full_unstemmed Optimization approaches for integrating cutting stock and flow shop scheduling with setup times in automotive chassis manufacturing
title_sort Optimization approaches for integrating cutting stock and flow shop scheduling with setup times in automotive chassis manufacturing
author Souza, Raínne Florisbelo Gonçalves de
author_facet Souza, Raínne Florisbelo Gonçalves de
author_role author
dc.contributor.none.fl_str_mv Nagano, Marcelo Seido
dc.contributor.author.fl_str_mv Souza, Raínne Florisbelo Gonçalves de
dc.subject.por.fl_str_mv corte de estoque
cutting stock
flow shop
flow shop scheduling
integrated scheduling
mathematical modeling
modelagem matemática
problemas integrados
sequence-dependent setup times
setup dependente da sequência
topic corte de estoque
cutting stock
flow shop
flow shop scheduling
integrated scheduling
mathematical modeling
modelagem matemática
problemas integrados
sequence-dependent setup times
setup dependente da sequência
description With the growing competitiveness in the market, industries are seeking ways to differentiate themselves and reduce production costs to increase profits. This has led many researchers to focus on studying integrated problems, as various aspects within an industrial setting are interconnected and can impact the overall production costs. This research specifically studies an integrated problem of cutting stock and permutation flow shop scheduling with sequence-dependent setup times found in the automotive industry as it is an unexplored area. The cutting stock process is responsible for providing the items required in production. Only when items are available, the flow shop production can be initiated. Besides that, there are sequence-dependent setup times between jobs to be processed on machines. Studying the integrated problem may improve the efficiency of the whole process. This thesis provides an understanding of the problem and its relevance in practical scenarios. A mixed integer linear programming is proposed as well as exact and heuristic resolution methods. For computational experiments, some instances were generated and the proposed methods were compared with one another. Results showed that the proposed exact method yielded quality solutions for small instances and the usage of a method to provide a good feasible initial solution may enhance the results. Furthermore, the proposed heuristic method based on the Adaptive Large Neighborhood Search (ALNS) algorithm outperformed the other tested methods, validating its quality and efficiency
publishDate 2025
dc.date.none.fl_str_mv 2025-01-27
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-04042025-074450/
url https://www.teses.usp.br/teses/disponiveis/18/18156/tde-04042025-074450/
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_ 1839839138588655616

Registros relacionados