On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem

The most efficient approximate procedures so far for the flowshop scheduling problem with makespan objective – i.e. the NEH heuristic and the iterated greedy algorithm – are based on constructing a sequence by iteratively inserting, one by one, the non-scheduled jobs into all positions of an existin...

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 enviada para evaluación y publicación
Fecha de publicación:2014
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/95265
Acceso en línea:https://hdl.handle.net/11441/95265
https://doi.org/10.1016/j.cor.2013.12.012
Access Level:acceso abierto
Palabra clave:Scheduling
Flowshop
Heuristics
id ES_52a0892117052d5410dc8039cc65cf0e
oai_identifier_str oai:idus.us.es:11441/95265
network_acronym_str ES
network_name_str España
repository_id_str
spelling On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problemFernández-Viagas Escudero, VíctorFramiñán Torres, José ManuelSchedulingFlowshopHeuristicsThe most efficient approximate procedures so far for the flowshop scheduling problem with makespan objective – i.e. the NEH heuristic and the iterated greedy algorithm – are based on constructing a sequence by iteratively inserting, one by one, the non-scheduled jobs into all positions of an existing subsequence, and then, among the so obtained subsequences, selecting the one yielding the lowest (partial) makespan. This procedure usually causes a high number of ties (different subsequences with the same best partial makespan) that must be broken via a tie-breaking mechanism. The particular tie-breaking mechanism employed is known to have a great influence in the performance of the NEH, therefore different procedures have been proposed in the literature. However, to the best of our knowledge, no tie-breaking mechanism has been proposed for the iterated greedy. In our paper, we present a new tie-breaking mechanism based on an estimation of the idle times of the different subsequences in order to pick the one with the lowest value of the estimation. The computational experiments carried out show that this mechanism outperforms the existing ones both for the NEH and the iterated greedy for different CPU times. Furthermore, embedding the proposed tie-breaking mechanism into the iterated greedy provides the most efficient heuristic for the problem so far.Ministerio de Ciencia e Innovación DPI2010-15573/DPIElsevierOrganización Industrial y Gestión de Empresas I2014info:eu-repo/semantics/articleinfo:eu-repo/semantics/submittedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/95265https://doi.org/10.1016/j.cor.2013.12.012reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésComputers & Operations Research, 45, 60-67.DPI2010-15573/DPIhttps://www.sciencedirect.com/science/article/abs/pii/S0305054813003638info:eu-repo/semantics/openAccessoai:idus.us.es:11441/952652026-06-17T12:51:07Z
dc.title.none.fl_str_mv On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
title On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
spellingShingle On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
Fernández-Viagas Escudero, Víctor
Scheduling
Flowshop
Heuristics
title_short On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
title_full On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
title_fullStr On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
title_full_unstemmed On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
title_sort On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
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 The most efficient approximate procedures so far for the flowshop scheduling problem with makespan objective – i.e. the NEH heuristic and the iterated greedy algorithm – are based on constructing a sequence by iteratively inserting, one by one, the non-scheduled jobs into all positions of an existing subsequence, and then, among the so obtained subsequences, selecting the one yielding the lowest (partial) makespan. This procedure usually causes a high number of ties (different subsequences with the same best partial makespan) that must be broken via a tie-breaking mechanism. The particular tie-breaking mechanism employed is known to have a great influence in the performance of the NEH, therefore different procedures have been proposed in the literature. However, to the best of our knowledge, no tie-breaking mechanism has been proposed for the iterated greedy. In our paper, we present a new tie-breaking mechanism based on an estimation of the idle times of the different subsequences in order to pick the one with the lowest value of the estimation. The computational experiments carried out show that this mechanism outperforms the existing ones both for the NEH and the iterated greedy for different CPU times. Furthermore, embedding the proposed tie-breaking mechanism into the iterated greedy provides the most efficient heuristic for the problem so far.
publishDate 2014
dc.date.none.fl_str_mv 2014
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/submittedVersion
format article
status_str submittedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/95265
https://doi.org/10.1016/j.cor.2013.12.012
url https://hdl.handle.net/11441/95265
https://doi.org/10.1016/j.cor.2013.12.012
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Computers & Operations Research, 45, 60-67.
DPI2010-15573/DPI
https://www.sciencedirect.com/science/article/abs/pii/S0305054813003638
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_ 1869408061483909120
score 15,300719

Similares en LA Referencia