Modelos e algoritmos para o flowshop híbrido com tempos de preparaçãodependentes da sequência e da máquina

Detalhes bibliográficos
Ano de defesa: 2016
Autor(a) principal: Karina Lissette Llacsa Saravia
Orientador(a): Não Informado pela instituição
Banca de defesa: Não Informado pela instituição
Tipo de documento: Dissertação
Tipo de acesso: Acesso aberto
Idioma: por
Instituição de defesa: Universidade Federal de Minas Gerais
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:
Programação heuristica
Engenharia de produção
ILS
Metaheurística
Sequenciamento
Relax and fix
Flowshop híbrido
Makespan
Heurística
Link de acesso: https://hdl.handle.net/1843/BUBD-AA5HY5
Resumo: This work focuses the Hybrid Flow Shop scheduling problem with sequence-dependent setup time, as well as machine, considering initially three performance criteria: Minimize makespan, time processing and the number of overdue tasks. For contextualization of the problem studied, are shown techniques used to solve similar problems.Initially, models of mixed integer linear programming (MILP) are adapted to represent the problem addressed. These models were implemented using a modeling tool and solved by a commercial software, being test instances generated randomly. The computational experiments provide the optimal solution in a time limit. However, the solutions are going away from the optimum for large instances. In addition, are proposedalgorithms based on "Relax and Fix"heuristic which are worked on outperformed MILP model, is developed a heuristic that determines some features of the problem and finally,is developed a ILS metaheuristic, this time considering only one performance criterion: Minimize makespan. The results of these algorithms are reported andcompared evaluating the performance criterion behavior.
id UFMG_6bfa85d5daa60fea86678e6c6343f0a7
oai_identifier_str oai:repositorio.ufmg.br:1843/BUBD-AA5HY5
network_acronym_str UFMG
network_name_str Repositório Institucional da UFMG
repository_id_str
spelling Modelos e algoritmos para o flowshop híbrido com tempos de preparaçãodependentes da sequência e da máquinaProgramação heuristicaEngenharia de produçãoILSMetaheurísticaSequenciamentoRelax and fixFlowshop híbridoMakespanHeurísticaThis work focuses the Hybrid Flow Shop scheduling problem with sequence-dependent setup time, as well as machine, considering initially three performance criteria: Minimize makespan, time processing and the number of overdue tasks. For contextualization of the problem studied, are shown techniques used to solve similar problems.Initially, models of mixed integer linear programming (MILP) are adapted to represent the problem addressed. These models were implemented using a modeling tool and solved by a commercial software, being test instances generated randomly. The computational experiments provide the optimal solution in a time limit. However, the solutions are going away from the optimum for large instances. In addition, are proposedalgorithms based on "Relax and Fix"heuristic which are worked on outperformed MILP model, is developed a heuristic that determines some features of the problem and finally,is developed a ILS metaheuristic, this time considering only one performance criterion: Minimize makespan. The results of these algorithms are reported andcompared evaluating the performance criterion behavior.Universidade Federal de Minas Gerais2019-08-09T15:35:55Z2025-09-09T01:22:26Z2019-08-09T15:35:55Z2016-02-26info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisapplication/pdfhttps://hdl.handle.net/1843/BUBD-AA5HY5Karina Lissette Llacsa Saraviainfo:eu-repo/semantics/openAccessporreponame:Repositório Institucional da UFMGinstname:Universidade Federal de Minas Gerais (UFMG)instacron:UFMG2025-09-09T01:22:26Zoai:repositorio.ufmg.br:1843/BUBD-AA5HY5Repositório InstitucionalPUBhttps://repositorio.ufmg.br/oairepositorio@ufmg.bropendoar:2025-09-09T01:22:26Repositório Institucional da UFMG - Universidade Federal de Minas Gerais (UFMG)false
dc.title.none.fl_str_mv Modelos e algoritmos para o flowshop híbrido com tempos de preparaçãodependentes da sequência e da máquina
title Modelos e algoritmos para o flowshop híbrido com tempos de preparaçãodependentes da sequência e da máquina
spellingShingle Modelos e algoritmos para o flowshop híbrido com tempos de preparaçãodependentes da sequência e da máquina
Karina Lissette Llacsa Saravia
Programação heuristica
Engenharia de produção
ILS
Metaheurística
Sequenciamento
Relax and fix
Flowshop híbrido
Makespan
Heurística
title_short Modelos e algoritmos para o flowshop híbrido com tempos de preparaçãodependentes da sequência e da máquina
title_full Modelos e algoritmos para o flowshop híbrido com tempos de preparaçãodependentes da sequência e da máquina
title_fullStr Modelos e algoritmos para o flowshop híbrido com tempos de preparaçãodependentes da sequência e da máquina
title_full_unstemmed Modelos e algoritmos para o flowshop híbrido com tempos de preparaçãodependentes da sequência e da máquina
title_sort Modelos e algoritmos para o flowshop híbrido com tempos de preparaçãodependentes da sequência e da máquina
author Karina Lissette Llacsa Saravia
author_facet Karina Lissette Llacsa Saravia
author_role author
dc.contributor.author.fl_str_mv Karina Lissette Llacsa Saravia
dc.subject.por.fl_str_mv Programação heuristica
Engenharia de produção
ILS
Metaheurística
Sequenciamento
Relax and fix
Flowshop híbrido
Makespan
Heurística
topic Programação heuristica
Engenharia de produção
ILS
Metaheurística
Sequenciamento
Relax and fix
Flowshop híbrido
Makespan
Heurística
description This work focuses the Hybrid Flow Shop scheduling problem with sequence-dependent setup time, as well as machine, considering initially three performance criteria: Minimize makespan, time processing and the number of overdue tasks. For contextualization of the problem studied, are shown techniques used to solve similar problems.Initially, models of mixed integer linear programming (MILP) are adapted to represent the problem addressed. These models were implemented using a modeling tool and solved by a commercial software, being test instances generated randomly. The computational experiments provide the optimal solution in a time limit. However, the solutions are going away from the optimum for large instances. In addition, are proposedalgorithms based on "Relax and Fix"heuristic which are worked on outperformed MILP model, is developed a heuristic that determines some features of the problem and finally,is developed a ILS metaheuristic, this time considering only one performance criterion: Minimize makespan. The results of these algorithms are reported andcompared evaluating the performance criterion behavior.
publishDate 2016
dc.date.none.fl_str_mv 2016-02-26
2019-08-09T15:35:55Z
2019-08-09T15:35:55Z
2025-09-09T01:22:26Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/masterThesis
format masterThesis
status_str publishedVersion
dc.identifier.uri.fl_str_mv https://hdl.handle.net/1843/BUBD-AA5HY5
url https://hdl.handle.net/1843/BUBD-AA5HY5
dc.language.iso.fl_str_mv por
language por
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Universidade Federal de Minas Gerais
publisher.none.fl_str_mv Universidade Federal de Minas Gerais
dc.source.none.fl_str_mv reponame:Repositório Institucional da UFMG
instname:Universidade Federal de Minas Gerais (UFMG)
instacron:UFMG
instname_str Universidade Federal de Minas Gerais (UFMG)
instacron_str UFMG
institution UFMG
reponame_str Repositório Institucional da UFMG
collection Repositório Institucional da UFMG
repository.name.fl_str_mv Repositório Institucional da UFMG - Universidade Federal de Minas Gerais (UFMG)
repository.mail.fl_str_mv repositorio@ufmg.br
_version_ 1856414022610452480

Registros relacionados