Sequencing CONWIP flow-shops: Analysis and heuristics

In this paper, we address the backlog sequencing problem in a flow-shop controlled by a CON\VIP production control system with the objective to minimise the make span We characterise the problem and analyse its similarities and differences with the permutation flow-shop problem A comparison of same 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 permutation flow-shop problem.