Multi-objective variable neighborhood search algorithms for a single machine scheduling problem with distinct due windows

In this paper, we compare three multi-objective algorithms based on Variable Neighborhood Search (VNS) heuristic. The algorithms are applied to solve the single machine scheduling problem with sequence dependent setup times and distinct due windows. In this problem, we consider minimizing the total...

Descripción completa

Detalles Bibliográficos
Autores: Arroyo, José Elias Claudio, Ottoni, Rafael dos Santos, Oliveira, Alcione de Paiva
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/21631
Acceso en línea:https://doi.org/10.1016/j.entcs.2011.11.022
http://www.locus.ufv.br/handle/123456789/21631
Access Level:acceso abierto
Palabra clave:Multi-objective optimization
Local search heuristics
Job scheduling
id BR_fa08ebfba1936c016cdd67448bf649cd
oai_identifier_str oai:locus.ufv.br:123456789/21631
network_acronym_str BR
network_name_str Brasil
repository_id_str
spelling Multi-objective variable neighborhood search algorithms for a single machine scheduling problem with distinct due windowsMulti-objective optimizationLocal search heuristicsJob schedulingIn this paper, we compare three multi-objective algorithms based on Variable Neighborhood Search (VNS) heuristic. The algorithms are applied to solve the single machine scheduling problem with sequence dependent setup times and distinct due windows. In this problem, we consider minimizing the total weighted earliness/tardiness and the total flowtime criteria. We introduce two intensification procedures to improve a multi-objective VNS (MOVNS) algorithm proposed in the literature. The performance of the algorithms is tested on a set of medium and larger instances of the problem. The computational results show that the proposed algorithms outperform the original MOVNS algorithm in terms of solution quality. A statistical analysis is conducted in order to analyze the performance of the proposed methods.Electronic Notes in Theoretical Computer Science2018-09-04T17:06:46Z2018-09-04T17:06:46Z2011-12-29info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlepdfapplication/pdf15710661https://doi.org/10.1016/j.entcs.2011.11.022http://www.locus.ufv.br/handle/123456789/21631engv. 281, p. 5- 19, december 2011info:eu-repo/semantics/openAccessreponame:LOCUS Repositório Institucional da UFVinstname:Universidade Federal de Viçosa (UFV)instacron:UFVArroyo, José Elias ClaudioOttoni, Rafael dos SantosOliveira, Alcione de Paiva2024-07-12T08:19:22Zoai:locus.ufv.br:123456789/21631Repositório InstitucionalPUBhttps://www.locus.ufv.br/oai/requestfabiojreis@ufv.bropendoar:21452024-07-12T08:19:22LOCUS Repositório Institucional da UFV - Universidade Federal de Viçosa (UFV)false
dc.title.none.fl_str_mv Multi-objective variable neighborhood search algorithms for a single machine scheduling problem with distinct due windows
title Multi-objective variable neighborhood search algorithms for a single machine scheduling problem with distinct due windows
spellingShingle Multi-objective variable neighborhood search algorithms for a single machine scheduling problem with distinct due windows
Arroyo, José Elias Claudio
Multi-objective optimization
Local search heuristics
Job scheduling
title_short Multi-objective variable neighborhood search algorithms for a single machine scheduling problem with distinct due windows
title_full Multi-objective variable neighborhood search algorithms for a single machine scheduling problem with distinct due windows
title_fullStr Multi-objective variable neighborhood search algorithms for a single machine scheduling problem with distinct due windows
title_full_unstemmed Multi-objective variable neighborhood search algorithms for a single machine scheduling problem with distinct due windows
title_sort Multi-objective variable neighborhood search algorithms for a single machine scheduling problem with distinct due windows
dc.creator.none.fl_str_mv Arroyo, José Elias Claudio
Ottoni, Rafael dos Santos
Oliveira, Alcione de Paiva
author Arroyo, José Elias Claudio
author_facet Arroyo, José Elias Claudio
Ottoni, Rafael dos Santos
Oliveira, Alcione de Paiva
author_role author
author2 Ottoni, Rafael dos Santos
Oliveira, Alcione de Paiva
author2_role author
author
dc.subject.por.fl_str_mv Multi-objective optimization
Local search heuristics
Job scheduling
topic Multi-objective optimization
Local search heuristics
Job scheduling
description In this paper, we compare three multi-objective algorithms based on Variable Neighborhood Search (VNS) heuristic. The algorithms are applied to solve the single machine scheduling problem with sequence dependent setup times and distinct due windows. In this problem, we consider minimizing the total weighted earliness/tardiness and the total flowtime criteria. We introduce two intensification procedures to improve a multi-objective VNS (MOVNS) algorithm proposed in the literature. The performance of the algorithms is tested on a set of medium and larger instances of the problem. The computational results show that the proposed algorithms outperform the original MOVNS algorithm in terms of solution quality. A statistical analysis is conducted in order to analyze the performance of the proposed methods.
publishDate 2011
dc.date.none.fl_str_mv 2011-12-29
2018-09-04T17:06:46Z
2018-09-04T17:06:46Z
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 15710661
https://doi.org/10.1016/j.entcs.2011.11.022
http://www.locus.ufv.br/handle/123456789/21631
identifier_str_mv 15710661
url https://doi.org/10.1016/j.entcs.2011.11.022
http://www.locus.ufv.br/handle/123456789/21631
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv v. 281, p. 5- 19, december 2011
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv pdf
application/pdf
dc.publisher.none.fl_str_mv Electronic Notes in Theoretical Computer Science
publisher.none.fl_str_mv Electronic Notes in Theoretical Computer Science
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_ 1853667200927268864
score 15.300724

Similares en LA Referencia