2020-12-042020-12-042010Framiñá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.0020-7543https://hdl.handle.net/11441/102986In 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.application/pdf15 p.engAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/SchedulingSequencingFlow-shopinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccess10.1080/002075401100489726701370