Artículo
Sequencing CONWIP flow-shops: Analysis and heuristics
Autor/es | Framiñán Torres, José Manuel
![]() ![]() ![]() ![]() ![]() ![]() ![]() Ruiz Usano, Rafael Leisten, Rainer |
Departamento | Universidad de Sevilla. Departamento de Organización Industrial y Gestión de Empresas I |
Fecha de publicación | 2010 |
Fecha de depósito | 2020-12-04 |
Publicado en |
|
Resumen | In this paper, we address the backlog sequencing problem in a flow-shop controlled by a CONWIP production control system, with the objective to minimize the makespan. We characterize the problem and analyse its similarities ... In this paper, we address the backlog sequencing problem in a flow-shop controlled by a CONWIP production control system, with the objective to minimize the makespan. We characterize the problem and analyse its similarities and differences with the unconstrained permutation flow-shop problem. A comparison of some well-known flow-shop heuristics is carried out, and a simple and fast dispatching rule is proposed. Regarding the more simple and faster heuristics, the proposed dispatching rule outperforms those commonly used for the unconstrained permutation flow-shop problem. |
Cita | Framiñán Torres, J.M., Ruiz-Usano, R. y Leisten, R. (2010). Sequencing CONWIP flow-shops: Analysis and heuristics. International Journal of Production Research, 39 (12), 2735-2749. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
7030981.pdf | 1.531Mb | ![]() | Ver/ | |