Controlling shop floor operations in a multi-family, multi-cell manufacturing environment through constant work-in-process

This paper discusses pertinent issues in applying CONstant Work-In-Process (CONWIP) principles to control shop floor operations in a manufacturing environment characterized by several product families processed along different routes in several production cells. The approach we take is to simultaneously answer two major questions: (1) what is the best WIP level? and (2) how to arrange the backlog list for a given system? The problem is posed as a mathematical programming model and solved via a simulated annealing heuristic. We design an experiment that captures essential elements of the systems under investigation. We then execute an extensive simulation to evaluate the effectiveness of various control schemes in a multi-cell, multi-family production environment. Specifically, we compare two variants of CONWIP control, one where containers are restricted to stay within given cells all the time and the other where containers are allowed to move through the entire system. We demonstrate the superiority of the latter in all the simulated scenarios.

[1]  Wallace J. Hopp,et al.  Factory physics : foundations of manufacturing management , 1996 .

[2]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[3]  Nallan C. Suresh,et al.  Coping with the Loss of Pooling Synergy in Cellular Manufacturing Systems , 1994 .

[4]  Izak Duenyas,et al.  Release policies for assembly systems , 1995 .

[5]  Izak Duenyas,et al.  Estimating the throughput of a cyclic assembly system , 1994 .

[6]  Michael Masin,et al.  Mathematical programming formulation of CONWIP based production lines; and relationships to MRP , 1997 .

[7]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[8]  Farzad Mahmoodi,et al.  A comprehensive analysis of group scheduling heuristics in a job shop cell , 1993 .

[9]  Y. T. Herer,et al.  CONWIP-based production lines with multiple bottlenecks: performance and design implications , 1999 .

[10]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[11]  T. L. Ward,et al.  Solving Quadratic Assignment Problems by ‘Simulated Annealing’ , 1987 .

[12]  William H. Press,et al.  Numerical recipes in C. The art of scientific computing , 1987 .

[13]  Wallace J. Hopp,et al.  Characterizing the Output Process of a CONWIP Line with Deterministic Processing and Random Outages , 1993 .

[14]  Vijay R. Kannan,et al.  A Virtual Cellular Manufacturing Approach to Batch Production , 1996 .

[15]  Jonathan F. Bard,et al.  Determining the number of kanbans in a multiproduct, multistage production system , 1991 .

[16]  Yuehwern Yih,et al.  Generic kanban systems for dynamic environments , 1994 .

[17]  David L. Woodruff,et al.  CONWIP: a pull alternative to kanban , 1990 .

[18]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[19]  David K. Smith,et al.  The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..