A GRASP heuristic for the multi-objective permutation flowshop scheduling problem

This paper presents a multi-objective greedy randomized adaptive search procedure (GRASP)-based heuristic for solving the permutation flowshop scheduling problem in order to minimize two and three objectives simultaneously: (1) makespan and maximum tardiness; (2) makespan, maximum tardiness, and tot...

Descripción completa

Detalles Bibliográficos
Autores: Arroyo, José Elias Claudio, Pereira, Ana Amélia de Souza
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2011
País:Brasil
Institución:Universidade Federal de Viçosa (UFV)
Repositorio:LOCUS Repositório Institucional da UFV
Idioma:inglés
OAI Identifier:oai:locus.ufv.br:123456789/21547
Acceso en línea:https://doi.org/10.1007/s00170-010-3100-x
http://www.locus.ufv.br/handle/123456789/21547
Access Level:acceso abierto
Palabra clave:Flowshop scheduling
Multi-objective combinatorial optimization
Heuristics
GRASP
id BR_224a6edd1399e254855c89532ea5cab5
oai_identifier_str oai:locus.ufv.br:123456789/21547
network_acronym_str BR
network_name_str Brasil
repository_id_str
spelling A GRASP heuristic for the multi-objective permutation flowshop scheduling problemFlowshop schedulingMulti-objective combinatorial optimizationHeuristicsGRASPThis paper presents a multi-objective greedy randomized adaptive search procedure (GRASP)-based heuristic for solving the permutation flowshop scheduling problem in order to minimize two and three objectives simultaneously: (1) makespan and maximum tardiness; (2) makespan, maximum tardiness, and total flowtime. GRASP is a competitive metaheuristic for solving combinatorial optimization problems. We have customized the basic concepts of GRASP algorithm to solve a multi-objective problem and a new algorithm named multi-objective GRASP algorithm is proposed. In order to find a variety of non-dominated solutions, the heuristic blends two typical approaches used in multi-objective optimization: scalarizing functions and Pareto dominance. For instances involving two machines, the heuristic is compared with a bi-objective branch-and-bound algorithm proposed in the literature. For instances involving up to 80 jobs and 20 machines, the non-dominated solutions obtained by the heuristic are compared with solutions obtained by multi-objective genetic algorithms from the literature. Computational results indicate that GRASP is a promising approach for multi-objective optimization.The International Journal of Advanced Manufacturing Technology2018-08-30T17:08:03Z2018-08-30T17:08:03Z2011-07info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlepdfapplication/pdf14333015https://doi.org/10.1007/s00170-010-3100-xhttp://www.locus.ufv.br/handle/123456789/21547engv. 55, n. 5– 8, p. 741– 753, july 2011Springer-Verlag London Limitedinfo:eu-repo/semantics/openAccessreponame:LOCUS Repositório Institucional da UFVinstname:Universidade Federal de Viçosa (UFV)instacron:UFVArroyo, José Elias ClaudioPereira, Ana Amélia de Souza2024-07-12T08:34:12Zoai:locus.ufv.br:123456789/21547Repositório InstitucionalPUBhttps://www.locus.ufv.br/oai/requestfabiojreis@ufv.bropendoar:21452024-07-12T08:34:12LOCUS Repositório Institucional da UFV - Universidade Federal de Viçosa (UFV)false
dc.title.none.fl_str_mv A GRASP heuristic for the multi-objective permutation flowshop scheduling problem
title A GRASP heuristic for the multi-objective permutation flowshop scheduling problem
spellingShingle A GRASP heuristic for the multi-objective permutation flowshop scheduling problem
Arroyo, José Elias Claudio
Flowshop scheduling
Multi-objective combinatorial optimization
Heuristics
GRASP
title_short A GRASP heuristic for the multi-objective permutation flowshop scheduling problem
title_full A GRASP heuristic for the multi-objective permutation flowshop scheduling problem
title_fullStr A GRASP heuristic for the multi-objective permutation flowshop scheduling problem
title_full_unstemmed A GRASP heuristic for the multi-objective permutation flowshop scheduling problem
title_sort A GRASP heuristic for the multi-objective permutation flowshop scheduling problem
dc.creator.none.fl_str_mv Arroyo, José Elias Claudio
Pereira, Ana Amélia de Souza
author Arroyo, José Elias Claudio
author_facet Arroyo, José Elias Claudio
Pereira, Ana Amélia de Souza
author_role author
author2 Pereira, Ana Amélia de Souza
author2_role author
dc.subject.por.fl_str_mv Flowshop scheduling
Multi-objective combinatorial optimization
Heuristics
GRASP
topic Flowshop scheduling
Multi-objective combinatorial optimization
Heuristics
GRASP
description This paper presents a multi-objective greedy randomized adaptive search procedure (GRASP)-based heuristic for solving the permutation flowshop scheduling problem in order to minimize two and three objectives simultaneously: (1) makespan and maximum tardiness; (2) makespan, maximum tardiness, and total flowtime. GRASP is a competitive metaheuristic for solving combinatorial optimization problems. We have customized the basic concepts of GRASP algorithm to solve a multi-objective problem and a new algorithm named multi-objective GRASP algorithm is proposed. In order to find a variety of non-dominated solutions, the heuristic blends two typical approaches used in multi-objective optimization: scalarizing functions and Pareto dominance. For instances involving two machines, the heuristic is compared with a bi-objective branch-and-bound algorithm proposed in the literature. For instances involving up to 80 jobs and 20 machines, the non-dominated solutions obtained by the heuristic are compared with solutions obtained by multi-objective genetic algorithms from the literature. Computational results indicate that GRASP is a promising approach for multi-objective optimization.
publishDate 2011
dc.date.none.fl_str_mv 2011-07
2018-08-30T17:08:03Z
2018-08-30T17:08:03Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv 14333015
https://doi.org/10.1007/s00170-010-3100-x
http://www.locus.ufv.br/handle/123456789/21547
identifier_str_mv 14333015
url https://doi.org/10.1007/s00170-010-3100-x
http://www.locus.ufv.br/handle/123456789/21547
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv v. 55, n. 5– 8, p. 741– 753, july 2011
dc.rights.driver.fl_str_mv Springer-Verlag London Limited
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Springer-Verlag London Limited
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv pdf
application/pdf
dc.publisher.none.fl_str_mv The International Journal of Advanced Manufacturing Technology
publisher.none.fl_str_mv The International Journal of Advanced Manufacturing Technology
dc.source.none.fl_str_mv reponame:LOCUS Repositório Institucional da UFV
instname:Universidade Federal de Viçosa (UFV)
instacron:UFV
instname_str Universidade Federal de Viçosa (UFV)
instacron_str UFV
institution UFV
reponame_str LOCUS Repositório Institucional da UFV
collection LOCUS Repositório Institucional da UFV
repository.name.fl_str_mv LOCUS Repositório Institucional da UFV - Universidade Federal de Viçosa (UFV)
repository.mail.fl_str_mv fabiojreis@ufv.br
_version_ 1853667219429392384
score 15,300719

Similares en LA Referencia