Article ID: | iaor2002223 |
Country: | United Kingdom |
Volume: | 39 |
Issue: | 12 |
Start Page Number: | 2735 |
End Page Number: | 2749 |
Publication Date: | Jan 2001 |
Journal: | International Journal of Production Research |
Authors: | Leisten Rainer, Framinan Jose M., Ruiz-Usano Rafael |
Keywords: | heuristics |
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.