- -

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

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

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

Show simple item record

Files in this item

dc.contributor.author Fernandez-Viagas, Victor es_ES
dc.contributor.author Ruiz García, Rubén es_ES
dc.contributor.author Framinan, Jose es_ES
dc.date.accessioned 2020-10-04T03:31:57Z
dc.date.available 2020-10-04T03:31:57Z
dc.date.issued 2017-03-16 es_ES
dc.identifier.issn 0377-2217 es_ES
dc.identifier.uri http://hdl.handle.net/10251/151044
dc.description.abstract [EN] 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. (C) 2016 Elsevier B.V. All rights reserved. es_ES
dc.description.sponsorship The authors are sincerely grateful to the anonymous referees, who provide very valuable comments on the earlier version of the paper. This research has been funded by the Spanish Ministry of Science and Innovation, under projects "ADDRESS" (DPI2013-44461-P/DPI) and "SCHEYARD" (DPI2015-65895-R) co-financed by FEDER funds. es_ES
dc.language Inglés es_ES
dc.publisher Elsevier es_ES
dc.relation.ispartof European Journal of Operational Research es_ES
dc.rights Reconocimiento - No comercial - Sin obra derivada (by-nc-nd) es_ES
dc.subject Scheduling es_ES
dc.subject Flowshop es_ES
dc.subject Heuristics es_ES
dc.subject Metaheuristics es_ES
dc.subject Computational evaluation es_ES
dc.subject.classification ESTADISTICA E INVESTIGACION OPERATIVA es_ES
dc.title A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1016/j.ejor.2016.09.055 es_ES
dc.relation.projectID info:eu-repo/grantAgreement/MINECO//DPI2015-65895-R/ES/OPTIMIZATION OF SCHEDULING PROBLEMS IN CONTAINER YARDS/ es_ES
dc.relation.projectID info:eu-repo/grantAgreement/MINECO//DPI2013-44461-P/ES/DISEÑO AVANZADO DE SISTEMAS DE PROGRAMACION DE LA PRODUCCION DINAMICOS, ROBUSTOS Y EXTENDIDOS/ es_ES
dc.rights.accessRights Abierto es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Estadística e Investigación Operativa Aplicadas y Calidad - Departament d'Estadística i Investigació Operativa Aplicades i Qualitat es_ES
dc.description.bibliographicCitation Fernandez-Viagas, V.; Ruiz García, R.; Framinan, J. (2017). A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation. European Journal of Operational Research. 257(3):707-721. https://doi.org/10.1016/j.ejor.2016.09.055 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion https://doi.org/10.1016/j.ejor.2016.09.055 es_ES
dc.description.upvformatpinicio 707 es_ES
dc.description.upvformatpfin 721 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 257 es_ES
dc.description.issue 3 es_ES
dc.relation.pasarela S\344052 es_ES
dc.contributor.funder European Regional Development Fund es_ES
dc.contributor.funder Ministerio de Economía y Competitividad es_ES


This item appears in the following Collection(s)

Show simple item record