Artículo
Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
Autor/es | Fernández-Viagas Escudero, Víctor
Pérez González, Paz Framiñán Torres, José Manuel |
Departamento | Universidad de Sevilla. Departamento de Organización Industrial y Gestión de Empresas I |
Fecha de publicación | 2019 |
Fecha de depósito | 2020-04-15 |
Publicado en |
|
Resumen | In this paper we address the classical hybrid flow shop scheduling problem with makespan objective. As this problem is known to be NP-hard and a very common layout in real-life manufacturing scenarios, many studies have ... In this paper we address the classical hybrid flow shop scheduling problem with makespan objective. As this problem is known to be NP-hard and a very common layout in real-life manufacturing scenarios, many studies have been proposed in the literature to solve it. These contributions use different solution representations of the feasible schedules, each one with its own advantages and disadvantages. Some of them do not guarantee that all feasible semiactive schedules are represented in the space of solutions –thus limiting in principle their effectiveness– but, on the other hand, these simpler solution representations possess clear advantages in terms of having consistent neighbourhoods with well-defined neighbourhood moves. Therefore, there is a trade-off between the solution space reduction and the ability to conduct an efficient search in this reduced solution space. This trade-off is determined by two aspects, i.e. the extent of the solution space reduction, and the quality of the schedules left aside by this solution space reduction. In this paper, we analyse the efficiency of the different solution representations employed in the literature for the problem. More specifically, we first establish the size of the space of semiactive schedules achieved by the different solution representations and, secondly, we address the issue of the quality of the schedules that can be achieved by these representations using the optimal solutions given by several MILP models and complete enumeration. The results obtained may contribute to design more efficient algorithms for the hybrid flow shop scheduling problem. |
Identificador del proyecto | DPI2016-80750-P |
Cita | Fernández-Viagas Escudero, V., Pérez González, P. y Framiñán Torres, J.M. (2019). Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective. Computers & Operations Research, 109, 77-88. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
prePrint copia_removed.pdf | 1.560Mb | [PDF] | Ver/ | |