On the modeling of line feeding systems with bin-kanban and logistic trains as polling systems

This paper deals with the part supply process in a mixed-model assembly line served by a logistic train. The logistic train periodically follows a fixed route (tour) and, in each tour, it visits all the stations for providing full bins of parts and retrieving the empty bins (which will be re-filled in a “supermarket” at the end of the tour). The aim of this paper is to analytically model such a system in order to support the dimensioning of both the logistic train and the station buffers. The innovative contribution consists in treating the system as a “polling system”, i.e., a set of queues attended by a single server. This allows us to consider the variability of the station cycle times and the tour duration of the logistic train. In particular, since the capacity of the logistic train is constrained by the number of wagons, the study generalizes approaches for the uncapacitated-server polling systems to the capacitated case.

[1]  Steve W. Fuhrmann,et al.  Analysis of Cyclic Service Systems with Limited Service: Bounds and Approximations , 1988, Perform. Evaluation.

[2]  Maurizio Faccio,et al.  Design and simulation of assembly line feeding systems in the automotive sector using supermarket, kanbans and tow trains: a general framework , 2013 .

[3]  Robert D. van der Mei,et al.  Polling systems with periodic server routing in heavy traffic: renewal arrivals , 2005, Oper. Res. Lett..

[4]  V. M. Vishnevskii,et al.  Mathematical methods to study the polling systems , 2006 .

[5]  Mandyam M. Srinivasan,et al.  A Decomposition Theorem for Polling Models: The Switchover Times are Effectively Additive , 1996, Oper. Res..

[6]  Leandros Tassiulas,et al.  Dynamic server allocation to parallel queues with randomly varying connectivity , 1993, IEEE Trans. Inf. Theory.

[7]  Andrea Grassi,et al.  Analytical modeling of part supply process in a bin-kanban system with logistic trains , 2015 .

[8]  J. P. C. Blanc An algorithmic solution of polling models with limited service disciplines , 1992, IEEE Trans. Commun..

[9]  J. P. C. Blanc Performance evaluation of polling systems by means of the power-series algorithm , 1992, Ann. Oper. Res..

[10]  Nils Boysen,et al.  Jena Research Papers in Business and Economics Optimally Routing and Scheduling Tow Trains for JIT-Supply of Mixed-Model Assembly Lines , 2010 .

[11]  J.P.C. Blanc The power-series algorithm for polling systems with time limits , 1998 .

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

[13]  Sem C. Borst,et al.  Polling Models With and Without Switchover Times , 1997, Oper. Res..

[14]  Hideaki Takagi,et al.  Analysis and Application of Polling Models , 2000, Performance Evaluation.

[15]  Mandyam M. Srinivasan,et al.  Relating polling models with zero and nonzero switchover times , 1995, Queueing Syst. Theory Appl..

[16]  Moshe Sidi,et al.  Polling systems: applications, modeling, and optimization , 1990, IEEE Trans. Commun..

[17]  Georg N. Krieg,et al.  Performance evaluation of two-stage multi-product kanban systems , 2008 .

[18]  Steve W. Fuhrmann,et al.  A decomposition result for a class of polling models , 1992, Queueing Syst. Theory Appl..

[19]  P. Wynn,et al.  On the Convergence and Stability of the Epsilon Algorithm , 1966 .