Artículo
A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem
Autor/es | Fernández-Viagas Escudero, Víctor
Framiñán Torres, José Manuel |
Departamento | Universidad de Sevilla. Departamento de Organización Industrial y Gestión de Empresas I |
Fecha de publicación | 2014 |
Fecha de depósito | 2020-04-16 |
Publicado en |
|
Resumen | As the interest of practitioners and researchers in scheduling in a multi-factory environment is growing, there is an increasing need to provide efficient algorithms for this type of decision problems, characterised by ... As the interest of practitioners and researchers in scheduling in a multi-factory environment is growing, there is an increasing need to provide efficient algorithms for this type of decision problems, characterised by simultaneously addressing the assignment of jobs to different factories/workshops and their subsequent scheduling. Here we address the so-called distributed permutation flowshop scheduling problem, in which a set of jobs has to be scheduled over a number of identical factories, each one with its machines arranged as a flowshop. Several heuristics have been designed for this problem, although there is no direct comparison among them. In this paper, we propose a new heuristic which exploits the specific structure of the problem. The computational experience carried out on a well-known testbed shows that the proposed heuristic outperforms existing state-of-the-art heuristics, being able to obtain better upper bounds for more than one quarter of the problems in the testbed. |
Identificador del proyecto | DPI2010-15573/DPI |
Cita | Fernández-Viagas Escudero, V. y Framiñán Torres, J.M. (2014). A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem. International Journal of Production Research, 53 (4), 1111-1123. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
PrePrintVersion_removed.pdf | 243.3Kb | [PDF] | Ver/ | |