NEH-based heuristics for the permutation flowshop scheduling problem to minimize total tardiness

Since Johnson׳s seminal paper in 1954, scheduling jobs in a permutation flowshop has been receiving the attention of hundreds of practitioners and researchers, being one of the most studied topics in the Operations Research literature. Among the different objectives that can be considered, minimisin...

Descripción completa

Detalles Bibliográficos
Autores: Fernández-Viagas Escudero, Víctor, Framiñán Torres, José Manuel
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2015
País:España
Institución:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/95287
Acceso en línea:https://hdl.handle.net/11441/95287
https://doi.org/10.1016/j.cor.2015.02.002
Access Level:acceso abierto
Palabra clave:Scheduling
Flowshop
Heuristics
id ES_3ad263263ad78356436d08c04eaf88c3
oai_identifier_str oai:idus.us.es:11441/95287
network_acronym_str ES
network_name_str España
repository_id_str
spelling NEH-based heuristics for the permutation flowshop scheduling problem to minimize total tardinessFernández-Viagas Escudero, VíctorFramiñán Torres, José ManuelSchedulingFlowshopHeuristicsSince Johnson׳s seminal paper in 1954, scheduling jobs in a permutation flowshop has been receiving the attention of hundreds of practitioners and researchers, being one of the most studied topics in the Operations Research literature. Among the different objectives that can be considered, minimising the total tardiness (i.e. the sum of the surplus of the completion time of each job over its due date) is regarded as a key objective for manufacturing companies, as it entails the fulfilment of the due dates committed to customers. Since this problem is known to be NP-hard, most research has focused on proposing approximate procedures to solve it in reasonable computation times. Particularly, several constructive heuristics have been proposed, with NEHedd being the most efficient one, serving also to provide an initial solution for more elaborate approximate procedures. In this paper, we first analyse in detail the decision problem depending on the generation of the due dates of the jobs, and discuss the similarities with different related decision problems. In addition, for the most characteristic tardiness scenario, the analysis shows that a huge number of ties appear during the construction of the solutions done by the NEHedd heuristic, and that wisely breaking the ties greatly influences the quality of the final solution. Since no tie-breaking mechanism has been designed for this heuristic up to now, we propose several mechanisms that are exhaustively tested. The results show that some of them outperform the original NEHedd by about 25% while keeping the same computational requirements.Ministerio de Ciencia e Innovación DPI2010-15573/DPIMinisterio de Ciencia e Innovación DPI2013-44461-P/DPIElsevierOrganización Industrial y Gestión de Empresas I2015info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/95287https://doi.org/10.1016/j.cor.2015.02.002reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésComputers & Operations Research, 60, 27-36.DPI2010-15573/DPIDPI2013-44461-P/DPIhttps://www.sciencedirect.com/science/article/abs/pii/S0305054815000258info:eu-repo/semantics/openAccessoai:idus.us.es:11441/952872026-06-17T12:51:07Z
dc.title.none.fl_str_mv NEH-based heuristics for the permutation flowshop scheduling problem to minimize total tardiness
title NEH-based heuristics for the permutation flowshop scheduling problem to minimize total tardiness
spellingShingle NEH-based heuristics for the permutation flowshop scheduling problem to minimize total tardiness
Fernández-Viagas Escudero, Víctor
Scheduling
Flowshop
Heuristics
title_short NEH-based heuristics for the permutation flowshop scheduling problem to minimize total tardiness
title_full NEH-based heuristics for the permutation flowshop scheduling problem to minimize total tardiness
title_fullStr NEH-based heuristics for the permutation flowshop scheduling problem to minimize total tardiness
title_full_unstemmed NEH-based heuristics for the permutation flowshop scheduling problem to minimize total tardiness
title_sort NEH-based heuristics for the permutation flowshop scheduling problem to minimize total tardiness
dc.creator.none.fl_str_mv Fernández-Viagas Escudero, Víctor
Framiñán Torres, José Manuel
author Fernández-Viagas Escudero, Víctor
author_facet Fernández-Viagas Escudero, Víctor
Framiñán Torres, José Manuel
author_role author
author2 Framiñán Torres, José Manuel
author2_role author
dc.contributor.none.fl_str_mv Organización Industrial y Gestión de Empresas I
dc.subject.none.fl_str_mv Scheduling
Flowshop
Heuristics
topic Scheduling
Flowshop
Heuristics
description Since Johnson׳s seminal paper in 1954, scheduling jobs in a permutation flowshop has been receiving the attention of hundreds of practitioners and researchers, being one of the most studied topics in the Operations Research literature. Among the different objectives that can be considered, minimising the total tardiness (i.e. the sum of the surplus of the completion time of each job over its due date) is regarded as a key objective for manufacturing companies, as it entails the fulfilment of the due dates committed to customers. Since this problem is known to be NP-hard, most research has focused on proposing approximate procedures to solve it in reasonable computation times. Particularly, several constructive heuristics have been proposed, with NEHedd being the most efficient one, serving also to provide an initial solution for more elaborate approximate procedures. In this paper, we first analyse in detail the decision problem depending on the generation of the due dates of the jobs, and discuss the similarities with different related decision problems. In addition, for the most characteristic tardiness scenario, the analysis shows that a huge number of ties appear during the construction of the solutions done by the NEHedd heuristic, and that wisely breaking the ties greatly influences the quality of the final solution. Since no tie-breaking mechanism has been designed for this heuristic up to now, we propose several mechanisms that are exhaustively tested. The results show that some of them outperform the original NEHedd by about 25% while keeping the same computational requirements.
publishDate 2015
dc.date.none.fl_str_mv 2015
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/95287
https://doi.org/10.1016/j.cor.2015.02.002
url https://hdl.handle.net/11441/95287
https://doi.org/10.1016/j.cor.2015.02.002
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Computers & Operations Research, 60, 27-36.
DPI2010-15573/DPI
DPI2013-44461-P/DPI
https://www.sciencedirect.com/science/article/abs/pii/S0305054815000258
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869406260218036224
score 15,301603

Similares en LA Referencia