A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation

The permutation flowshop problem is a classic machine scheduling problem where n jobs must be processed on a set of m machines disposed in series and where each job must visit all machines in the same order. Many production scheduling problems resemble flowshops and hence it has generated much inter...

Descripción completa

Detalles Bibliográficos
Autores: Fernández-Viagas Escudero, Víctor, Ruiz, Rubén, Framiñán Torres, José Manuel
Tipo de recurso: artículo
Estado:Versión enviada para evaluación y publicación
Fecha de publicación:2017
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/95289
Acceso en línea:https://hdl.handle.net/11441/95289
https://doi.org/10.1016/j.ejor.2016.09.055
Access Level:acceso abierto
Palabra clave:Scheduling
Flowshop
Heuristics
id ES_7b416a50c44f2dd2d322fc39564dcbea
oai_identifier_str oai:idus.us.es:11441/95289
network_acronym_str ES
network_name_str España
repository_id_str
spelling A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluationFernández-Viagas Escudero, VíctorRuiz, RubénFramiñán Torres, José ManuelSchedulingFlowshopHeuristicsThe permutation flowshop problem is a classic machine scheduling problem where n jobs must be processed on a set of m machines disposed in series and where each job must visit all machines in the same order. Many production scheduling problems resemble flowshops and hence it has generated much interest and had a big impact in the field, resulting in literally hundreds of heuristic and metaheuristic methods over the last 60 years. However, most methods proposed for makespan minimisation are not properly compared with existing procedures so currently it is not possible to know which are the most efficient methods for the problem regarding the quality of the solutions obtained and the computational effort required. In this paper, we identify and exhaustively compare the best existing heuristics and metaheuristics so the state-of-the-art regarding approximate procedures for this relevant problem is established.Ministerio de Ciencia e Innovación DPI2013-44461-P/DPIMinisterio de Ciencia e Innovación DPI2015-65895- RElsevierOrganización Industrial y Gestión de Empresas I2017info:eu-repo/semantics/articleinfo:eu-repo/semantics/submittedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/95289https://doi.org/10.1016/j.ejor.2016.09.055reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésEuropean Journal of Operational Research, 257 (3), 707-721.DPI2013-44461-P/DPIDPI2015-65895- Rhttps://www.sciencedirect.com/science/article/abs/pii/S0377221716308074#!info:eu-repo/semantics/openAccessoai:idus.us.es:11441/952892026-06-17T12:51:07Z
dc.title.none.fl_str_mv A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation
title A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation
spellingShingle A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation
Fernández-Viagas Escudero, Víctor
Scheduling
Flowshop
Heuristics
title_short A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation
title_full A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation
title_fullStr A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation
title_full_unstemmed A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation
title_sort A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation
dc.creator.none.fl_str_mv Fernández-Viagas Escudero, Víctor
Ruiz, Rubén
Framiñán Torres, José Manuel
author Fernández-Viagas Escudero, Víctor
author_facet Fernández-Viagas Escudero, Víctor
Ruiz, Rubén
Framiñán Torres, José Manuel
author_role author
author2 Ruiz, Rubén
Framiñán Torres, José Manuel
author2_role author
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 permutation flowshop problem is a classic machine scheduling problem where n jobs must be processed on a set of m machines disposed in series and where each job must visit all machines in the same order. Many production scheduling problems resemble flowshops and hence it has generated much interest and had a big impact in the field, resulting in literally hundreds of heuristic and metaheuristic methods over the last 60 years. However, most methods proposed for makespan minimisation are not properly compared with existing procedures so currently it is not possible to know which are the most efficient methods for the problem regarding the quality of the solutions obtained and the computational effort required. In this paper, we identify and exhaustively compare the best existing heuristics and metaheuristics so the state-of-the-art regarding approximate procedures for this relevant problem is established.
publishDate 2017
dc.date.none.fl_str_mv 2017
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/95289
https://doi.org/10.1016/j.ejor.2016.09.055
url https://hdl.handle.net/11441/95289
https://doi.org/10.1016/j.ejor.2016.09.055
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv European Journal of Operational Research, 257 (3), 707-721.
DPI2013-44461-P/DPI
DPI2015-65895- R
https://www.sciencedirect.com/science/article/abs/pii/S0377221716308074#!
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_ 1869411500918046720
score 15,301629

Similares en LA Referencia