Artículo
A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation
Autor/es | Fernández-Viagas Escudero, Víctor
Ruiz, Rubén Framiñán Torres, José Manuel |
Departamento | Universidad de Sevilla. Departamento de Organización Industrial y Gestión de Empresas I |
Fecha de publicación | 2017 |
Fecha de depósito | 2020-04-16 |
Publicado en |
|
Resumen | 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 ... 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. |
Identificador del proyecto | DPI2013-44461-P/DPI
DPI2015-65895- R |
Cita | Fernández-Viagas Escudero, V., Ruiz, R. y Framiñán Torres, J.M. (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. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
v7.05_removed.pdf | 556.2Kb | [PDF] | Ver/ | |