Performance analysis of single stage kanban controlled production systems using parametric decomposition

We present a new approach that permits efficient performance analysis of kanban systems with general demand processes, material arrival processes, and service times. The approach is based on parametric characterization of the traffic processes (arrival and departure) in the network and uses two-moment approximations to estimate performance measures at individual stations. We derive traffic flow constraints that are particular to closed queuing networks with synchronization stations and use these to establish relationships between the parameters characterizing arrival and departure processes at the stations in the network. The resultant set of non-linear equations is solved to estimate network performance measures. Numerical studies show that the approach is not only fast but also reasonably accurate when compared to simulation. These studies also provide insights with respect to the impact of different types of variability on the performance of a kanban system. This work also provides a fundamental building block that can be used in the analysis of multi-stage kanban systems.

[1]  W. Whitt Approximations for departure processes and queues in series , 1984 .

[2]  John A. Buzacott,et al.  Stochastic models of manufacturing systems , 1993 .

[3]  Heinrich Kuhn,et al.  Analysis of production control systems kanban and CONWIP , 1996 .

[4]  Mary K. Vernon,et al.  Two-Moment Approximations for Throughput and Mean Queue Length of a Fork/Join Station with General Inputs from Finite Populations , 2003 .

[5]  P. Kuehn,et al.  Approximate Analysis of General Queuing Networks by Decomposition , 1979, IEEE Trans. Commun..

[6]  K. T. Marshall,et al.  Some Inequalities in Queuing , 1968, Oper. Res..

[7]  Yves Dallery,et al.  An Analytical Method for Performance Evaluation of Kanban Controlled Production Systems , 1996, Oper. Res..

[8]  Yves Dallery,et al.  Approximate analysis of production systems operated by a CONWIP/finite buffer hybrid control policy , 2000 .

[9]  W. Whitt,et al.  The Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[10]  Manjunath Kamath,et al.  Analytical performance models for closed-loop flexible assembly systems , 1988 .

[11]  J. Muckstadt,et al.  A comparison of alternative Kanban control mechanisms , 1991 .

[12]  Mary K. Vernon,et al.  Analysis of a Fork/Join Synchronization Station with Inputs from Coxian Servers in a Closed Queuing Network , 2004, Ann. Oper. Res..

[13]  Georg N. Krieg,et al.  A decomposition method for multi-product kanban systems with setup times and lost sales , 2002 .

[14]  Debasis Mitra,et al.  Analysis of a Kanban Discipline for Cell Coordination in Production Lines, II: Stochastic Demands , 1991, Oper. Res..

[15]  J. George Shanthikumar,et al.  Jackson Network Models of Manufacturing Systems , 1994 .

[16]  Uday S. Karmarkar,et al.  Batching Policy in Kanban Systems , 1989 .

[17]  Kut C. So,et al.  Allocating buffer storages in a pull system , 1988 .

[18]  Debasis Mitra,et al.  Analysis of a Kanban discipline for cell coordination in production lines , 1990 .

[19]  M. Di Mascolo,et al.  Performance evaluation of kanban multiple-product production systems , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.

[20]  Rajan Suri,et al.  From CAN-Q to MPX: Evolution of Queuing Software for Manufacturing , 1995 .

[21]  John A. Muckstadt,et al.  A comparison of alternative kanban control mechanisms. II. Experimental results , 1995 .

[22]  S. Ryan,et al.  Total WIP and WIP mix for a CONWIP controlled job shop , 2003 .