A genetic algorithm and variable neighborhood search for the unrelated parallel machine scheduling problem with sequence dependent setup time

Detalhes bibliográficos
Autor(a) principal: Tozzo, Everton
Data de Publicação: 2018
Outros Autores: Cotrim, Syntia Lemos, Galdamez, Edwin Vladimir Cardoza, Leal, Gislaine Camila Lapasini
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Acta scientiarum. Technology (Online)
Texto Completo: http://www.periodicos.uem.br/ojs/index.php/ActaSciTechnol/article/view/36607
Resumo: This paper presents the evaluation of two metaheuristics to solve the Unrelated Parallel Machine Scheduling Problem with Sequence Machine Dependent Setup Time. Considering such a problem, there is no relation between the time to process each task and the machine; and this is why the machines are referred to as unrelated. Furthermore, the setup time between the executions of two tasks depends on both, the task sequence and its associated machine. A metaheuristic genetic algorithm and a variable neighborhood search were used in order to solve the problem due to the difference among their characteristics. The maximal time for the schedule to be completed, also called makespan, was the performance measure used to evaluate the solutions. The results obtained by both metaheuristics were directly compared according to their performance to try to reduce this makespan. The results showed that the variable neighborhood algorithm search outperformed the genetic algorithm regarding the solutions quality and execution time. 
id UEM-6_6156f8ea14933a0131a38ffc4e5fb1d1
oai_identifier_str oai:periodicos.uem.br/ojs:article/36607
network_acronym_str UEM-6
network_name_str Acta scientiarum. Technology (Online)
repository_id_str
spelling A genetic algorithm and variable neighborhood search for the unrelated parallel machine scheduling problem with sequence dependent setup timescheduling problemmachine schedulingmetaheuristic.engenharia de ProduçãoEngenharia de ProduçãoThis paper presents the evaluation of two metaheuristics to solve the Unrelated Parallel Machine Scheduling Problem with Sequence Machine Dependent Setup Time. Considering such a problem, there is no relation between the time to process each task and the machine; and this is why the machines are referred to as unrelated. Furthermore, the setup time between the executions of two tasks depends on both, the task sequence and its associated machine. A metaheuristic genetic algorithm and a variable neighborhood search were used in order to solve the problem due to the difference among their characteristics. The maximal time for the schedule to be completed, also called makespan, was the performance measure used to evaluate the solutions. The results obtained by both metaheuristics were directly compared according to their performance to try to reduce this makespan. The results showed that the variable neighborhood algorithm search outperformed the genetic algorithm regarding the solutions quality and execution time. Universidade Estadual De Maringá2018-09-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionmodelagem matemáticamodelagem matemáticaapplication/pdfhttp://www.periodicos.uem.br/ojs/index.php/ActaSciTechnol/article/view/3660710.4025/actascitechnol.v40i1.36607Acta Scientiarum. Technology; Vol 40 (2018): Publicação Contínua; e36607Acta Scientiarum. Technology; v. 40 (2018): Publicação Contínua; e366071806-25631807-8664reponame:Acta scientiarum. Technology (Online)instname:Universidade Estadual de Maringá (UEM)instacron:UEMenghttp://www.periodicos.uem.br/ojs/index.php/ActaSciTechnol/article/view/36607/pdfCopyright (c) 2018 Acta Scientiarum. Technologyhttps://creativecommons.org/licenses/by/4.0info:eu-repo/semantics/openAccessTozzo, EvertonCotrim, Syntia LemosGaldamez, Edwin Vladimir CardozaLeal, Gislaine Camila Lapasini2019-07-17T11:53:48Zoai:periodicos.uem.br/ojs:article/36607Revistahttps://www.periodicos.uem.br/ojs/index.php/ActaSciTechnol/indexPUBhttps://www.periodicos.uem.br/ojs/index.php/ActaSciTechnol/oai||actatech@uem.br1807-86641806-2563opendoar:2019-07-17T11:53:48Acta scientiarum. Technology (Online) - Universidade Estadual de Maringá (UEM)false
dc.title.none.fl_str_mv A genetic algorithm and variable neighborhood search for the unrelated parallel machine scheduling problem with sequence dependent setup time
title A genetic algorithm and variable neighborhood search for the unrelated parallel machine scheduling problem with sequence dependent setup time
spellingShingle A genetic algorithm and variable neighborhood search for the unrelated parallel machine scheduling problem with sequence dependent setup time
Tozzo, Everton
scheduling problem
machine scheduling
metaheuristic.
engenharia de Produção
Engenharia de Produção
title_short A genetic algorithm and variable neighborhood search for the unrelated parallel machine scheduling problem with sequence dependent setup time
title_full A genetic algorithm and variable neighborhood search for the unrelated parallel machine scheduling problem with sequence dependent setup time
title_fullStr A genetic algorithm and variable neighborhood search for the unrelated parallel machine scheduling problem with sequence dependent setup time
title_full_unstemmed A genetic algorithm and variable neighborhood search for the unrelated parallel machine scheduling problem with sequence dependent setup time
title_sort A genetic algorithm and variable neighborhood search for the unrelated parallel machine scheduling problem with sequence dependent setup time
author Tozzo, Everton
author_facet Tozzo, Everton
Cotrim, Syntia Lemos
Galdamez, Edwin Vladimir Cardoza
Leal, Gislaine Camila Lapasini
author_role author
author2 Cotrim, Syntia Lemos
Galdamez, Edwin Vladimir Cardoza
Leal, Gislaine Camila Lapasini
author2_role author
author
author
dc.contributor.author.fl_str_mv Tozzo, Everton
Cotrim, Syntia Lemos
Galdamez, Edwin Vladimir Cardoza
Leal, Gislaine Camila Lapasini
dc.subject.por.fl_str_mv scheduling problem
machine scheduling
metaheuristic.
engenharia de Produção
Engenharia de Produção
topic scheduling problem
machine scheduling
metaheuristic.
engenharia de Produção
Engenharia de Produção
description This paper presents the evaluation of two metaheuristics to solve the Unrelated Parallel Machine Scheduling Problem with Sequence Machine Dependent Setup Time. Considering such a problem, there is no relation between the time to process each task and the machine; and this is why the machines are referred to as unrelated. Furthermore, the setup time between the executions of two tasks depends on both, the task sequence and its associated machine. A metaheuristic genetic algorithm and a variable neighborhood search were used in order to solve the problem due to the difference among their characteristics. The maximal time for the schedule to be completed, also called makespan, was the performance measure used to evaluate the solutions. The results obtained by both metaheuristics were directly compared according to their performance to try to reduce this makespan. The results showed that the variable neighborhood algorithm search outperformed the genetic algorithm regarding the solutions quality and execution time. 
publishDate 2018
dc.date.none.fl_str_mv 2018-09-01
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
modelagem matemática
modelagem matemática
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://www.periodicos.uem.br/ojs/index.php/ActaSciTechnol/article/view/36607
10.4025/actascitechnol.v40i1.36607
url http://www.periodicos.uem.br/ojs/index.php/ActaSciTechnol/article/view/36607
identifier_str_mv 10.4025/actascitechnol.v40i1.36607
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv http://www.periodicos.uem.br/ojs/index.php/ActaSciTechnol/article/view/36607/pdf
dc.rights.driver.fl_str_mv Copyright (c) 2018 Acta Scientiarum. Technology
https://creativecommons.org/licenses/by/4.0
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Copyright (c) 2018 Acta Scientiarum. Technology
https://creativecommons.org/licenses/by/4.0
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Universidade Estadual De Maringá
publisher.none.fl_str_mv Universidade Estadual De Maringá
dc.source.none.fl_str_mv Acta Scientiarum. Technology; Vol 40 (2018): Publicação Contínua; e36607
Acta Scientiarum. Technology; v. 40 (2018): Publicação Contínua; e36607
1806-2563
1807-8664
reponame:Acta scientiarum. Technology (Online)
instname:Universidade Estadual de Maringá (UEM)
instacron:UEM
instname_str Universidade Estadual de Maringá (UEM)
instacron_str UEM
institution UEM
reponame_str Acta scientiarum. Technology (Online)
collection Acta scientiarum. Technology (Online)
repository.name.fl_str_mv Acta scientiarum. Technology (Online) - Universidade Estadual de Maringá (UEM)
repository.mail.fl_str_mv ||actatech@uem.br
_version_ 1799315336472821760