Analysis of tandem queues with finite buffer capacity

ABSTRACT Tandem queues with finite buffer capacity commonly exist in practical applications. By viewing a tandem queue as an integrated system, an innovative approach has been developed to analyze its performance through insight from Friedman's reduction method. In our approach, the starvation at the bottleneck caused by service time randomness is modeled by interruptions. Fundamental properties of tandem queues with finite buffer capacity are examined. Without the assumptions of phase-type distributions and stochastic independence, we show that, in general, the system service rate of a tandem queue with a finite buffer capacity is equal to or smaller than its bottleneck service rate, and virtual interruptions, which are the extra idle period at the bottleneck caused by the non-bottlenecks, depend on arrival rates. Hence, the system service rate is a function of arrival rates when the buffer capacity of a tandem queue is finite. Approximations for the mean queue time of a dual tandem queue are developed using the concept of virtual interruptions.

[1]  Leon F. McGinnis,et al.  Queueing models for a single machine subject to multiple types of interruptions , 2011 .

[2]  Jingshan Li,et al.  Throughput analysis of production systems: recent advances and future topics , 2009 .

[3]  Paola Inverardi,et al.  A review on queueing network models with finite capacity queues for software architectures performance prediction , 2003, Perform. Evaluation.

[4]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[5]  Marcel van Vuuren,et al.  Performance analysis of tandem queues with small buffers , 2009 .

[6]  Horst Tempelmeier,et al.  Performance evaluation of unbalanced flow lines with general distributed processing times, failures and imperfect production , 2001 .

[7]  F. G. Foster.  A Unified Theory for Stock, Storage and Queue Control* , 1959 .

[8]  Antonio Gómez-Corral,et al.  Sojourn times in a two‐stage queueing network with blocking , 2004 .

[9]  Gordon F. Newell,et al.  Cyclic Queuing Systems with Restricted Length Queues , 1967, Oper. Res..

[10]  Dong-Won Seo,et al.  Stationary Waiting Times in m-Node Tandem Queues With Production Blocking , 2011, IEEE Transactions on Automatic Control.

[11]  Ronald W. Wolff,et al.  The Optimal Order of Service in Tandem Queues , 1974, Oper. Res..

[12]  大野 耐一,et al.  Toyota production system : beyond large-scale production , 1988 .

[13]  Gordon C. Hunt,et al.  Sequential Arrays of Waiting Lines , 1956 .

[14]  Raif O. Onvural,et al.  Survey of closed queueing networks with blocking , 1990, CSUR.

[15]  Kan Wu,et al.  Classification of queueing models for a workstation with interruptions: a review , 2014 .

[16]  Robert R. Inman,et al.  EMPIRICAL EVALUATION OF EXPONENTIAL AND INDEPENDENCE ASSUMPTIONS IN QUEUEING MODELS OF MANUFACTURING SYSTEMS , 1999 .

[17]  Semyon M. Meerkov,et al.  DT-bottlenecks in serial production lines: theory and application , 2000, IEEE Trans. Robotics Autom..

[18]  Stefan Helber,et al.  Analysis of flow lines with Cox-2-distributed processing times and limited buffer capacity , 2005, OR Spectr..

[19]  Elias Yannopoulos,et al.  An Approximation Method for Queues in Series with Blocking , 1994, Perform. Evaluation.

[20]  P. Burke.  The Output of a Queuing System , 1956 .

[21]  Ning Zhao,et al.  Analysis of dual tandem queues with a finite buffer capacity and non-overlapping service times and subject to breakdowns , 2015 .

[22]  Frederick S. Hillier,et al.  Toward characterizing the optimal allocation of storage space in production line systems with variable processing times , 1993 .

[23]  Michael Gregory,et al.  Manufacturing Systems Engineering , 2015 .

[24]  Ronald W. Wolff,et al.  Bounds for Different Arrangements of Tandem Queues with Nonoverlapping Service Times , 1993 .

[25]  Marcel F. Neuts,et al.  Efficient Algorithmic Solutions to Exponential Tandem Queues with Blocking , 1980, SIAM J. Algebraic Discret. Methods.

[26]  Yung-Li Lily Jow,et al.  An approximation method for tandem queues with blocking , 1988 .

[27]  Leon F. McGinnis,et al.  Performance evaluation for general queueing networks in manufacturing systems: Characterizing the trade-off between queue time and utilization , 2012, Eur. J. Oper. Res..

[28]  Harry G. Perros,et al.  A Bibliography of Papers on Queueing Networks with Finite Capacity Queues , 1989, Perform. Evaluation.

[29]  Stanley B. Gershwin,et al.  A decomposition method for approximate evaluation of continuous flow multi-stage lines with general Markovian machines , 2013, Ann. Oper. Res..

[30]  B. Avi-Itzhak,et al.  A SEQUENCE OF SERVICE STATIONS WITH ARBITRARY INPUT AND REGULAR SERVICE TIMES , 1965 .

[31]  Yves Dallery,et al.  Manufacturing flow line systems: a review of models and analytical results , 1992, Queueing Syst. Theory Appl..

[32]  John A. Buzacott,et al.  Multistage flow line analysis with the stopped arrival queue model , 1995 .

[33]  J. Mehdi.  Stochastic Models in Queueing Theory , 1991 .

[34]  D. Iglehart,et al.  Multiple channel queues in heavy traffic. II: sequences, networks, and batches , 1970, Advances in Applied Probability.

[35]  Harry G. Perros,et al.  Approximate analysis of open networks of queues with blocking: Tandem configurations , 1986, IEEE Transactions on Software Engineering.

[36]  Ijbf Ivo Adan,et al.  Monotonicity of the throughput in single server production and assembly networks with respect to the buffer sizes , 1987 .

[37]  Ivo J. B. F. Adan,et al.  Approximate analysis of single-server tandem queues with finite buffers , 2011, Annals of Operations Research.

[38]  Frederick S. Hillier,et al.  The Assignment of Extra Servers to Stations in Tandem Queueing Systems with Small or No Buffers , 1989, Perform. Evaluation.

[39]  Henry D. Friedman,et al.  Reduction Methods for Tandem Queuing Systems , 1965 .

[40]  Demetres D. Kouvatsos,et al.  Queueing networks with blocking , 2003, Perform. Evaluation.

[41]  S. Fotopoulos.  Stochastic modeling and analysis of manufacturing systems , 1996 .

[42]  Yves Dallery,et al.  On Decomposition Methods for Tandem Queueing Networks with Blocking , 1993, Oper. Res..

[43]  Tayfur M. Altiok,et al.  Approximate analysis of exponential tandem queues with blocking , 1982 .

[44]  Taiichi Ohno,et al.  Toyota Production System : Beyond Large-Scale Production , 1988 .

[45]  G. Yamazaki,et al.  Properties of duality in tandem queueing systems , 1975 .

[46]  Alexandre Brandwajn,et al.  An Approximation Method for Tandem Queues with Blocking , 1988, Oper. Res..

[47]  Leon F. McGinnis,et al.  Interpolation approximations for queues in series , 2013 .