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...
| Authors: | , , |
|---|---|
| Format: | article |
| Status: | Versión enviada para evaluación y publicación |
| Publication Date: | 2017 |
| Country: | España |
| Institution: | Universidad de Sevilla (US) |
| Repository: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/95289 |
| Online Access: | https://hdl.handle.net/11441/95289 https://doi.org/10.1016/j.ejor.2016.09.055 |
| Access Level: | Open access |
| Keyword: | Scheduling Flowshop Heuristics |
| Summary: | 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. |
|---|