Sequencing CONWIP flow-shops: analysis and heuristics

摘要

In this paper, we address the backlog sequencing problem in a flow-shop con- trolled by a CONWIP production control system with the objective to minimize the makespan. We characterize the problem and analyse its similarities and dif- ferences 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 uncon- strained permutation flow-shop problem.