Approximation of throughput in tandem queues with multiple servers and blocking

Abstract In this paper, we develop an approximation method for throughput in tandem queues with multiple independent reliable servers at each stage and finite buffers between service stations. We consider the blocking after service (BAS) blocking protocol of each service stage. The service time distribution of each server is exponential. The approximation is based on the decomposition of the system into a set of coupled subsystems which are modeled by two-stage tandem queue with two buffers and are analyzed by using the level dependent quasi-birth-and-death (LDQBD) process.

[1]  Aiguo Wu,et al.  Multi-state throughput analysis of a two-stage manufacturing system with parallel unreliable machines and a finite buffer , 2012, Eur. J. Oper. Res..

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

[3]  Stanley B. Gershwin,et al.  Manufacturing Systems Engineering , 1993 .

[4]  Cathal Heavey,et al.  Approximate analysis of serial flow lines with multiple parallel-machine stations , 2007 .

[5]  Diamantidis C. Alexandros,et al.  Exact analysis of a two-workstation one-buffer flow line with parallel unreliable machines , 2009 .

[6]  Enver Ever,et al.  A hybrid approach to minimize state space explosion problem for the solution of two stage tandem queues , 2013, J. Netw. Comput. Appl..

[7]  Valentina Klimenok,et al.  A tandem GI/PH/1→•/PH/1/0 queue with blocking , 2013 .

[8]  Sae Simone Resing-Sassen,et al.  Performance analysis of multi-server tandem queues with finite buffers and blocking , 2005 .

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

[10]  Syed Asif Ali Shah,et al.  Performance Evaluation of Multisatge Service System Using Matrix Geometric Method , 2009, 2009 Fourth International Conference on Systems and Networks Communications.

[11]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

[12]  Enver Ever,et al.  Approximate solution for two stage open networks with Markov-modulated queues minimizing the state space explosion problem , 2009 .

[13]  Isi Mitrani,et al.  Approximate solutions for heavily loaded Markov-modulated queues , 2005, Perform. Evaluation.

[14]  Winfried K. Grassmann,et al.  An analytical solution for a tandem queue with blocking , 2000, Queueing Syst. Theory Appl..

[15]  D. Manjunath,et al.  Approximate analysis of open network of GE/GE/m/N queues with transfer blocking , 1999, MASCOTS '99. Proceedings of the Seventh International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

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

[17]  Sencer Yeralan,et al.  Models of production lines as quasi-birth-death processes , 2002 .

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

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

[20]  H. T. Papadopoulos,et al.  A recursive algorithm for generating the transition matrices of multistation multiserver exponential reliable queueing networks , 2001, Comput. Oper. Res..

[21]  Harry G. Perros.  Queueing networks with blocking , 1994 .

[22]  Sushant Jain,et al.  Open finite queueing networks with M/M/C/K parallel servers , 1994, Comput. Oper. Res..

[23]  Valentina Klimenok,et al.  Investigation of the BMAP/G/1→·/PH/1/M tandem queue with retrials and losses , 2010 .