A Retrial Queueing System with Orbital Search of Customers Lost from an Offer Zone

A tandem retrial queueing system with orbital search in which two self-service stations namely, the main station and the offer zone and an orbit for passive customers lost from the offer zone without joining the main station is considered. The main service station is of infinite capacity while the offer zone which works in a random environment and the orbit for passive customers are of finite capacities. Two types of customers arrive to the service stations according to a Marked Markovian Arrival Process (MMAP) with representation \((D_0,D_1,D_2).\) The service times in both stations are exponentially distributed. A virtual search mechanism associated with the main station will be working when the number of customers in the main station is below a pre-assigned level L. The duration of search is exponentially distributed. The condition for system stability is established. The system state distribution in the steady state is obtained. Several system performance characteristics are derived. An associated optimization problem is investigated.

[1]  Alexander N. Dudin,et al.  Analysis of the BMAP/G/1 retrial system with search of customers from the orbit , 2004, Eur. J. Oper. Res..

[2]  Marcel F. Neuts,et al.  Numerical investigation of a multiserver retrial model , 1990, Queueing Syst. Theory Appl..

[3]  Alexander N. Dudin,et al.  Tandem Queueing System with Correlated Input and Cross-Traffic , 2013, CN.

[4]  Alexander N. Dudin,et al.  On the Stationary Distribution of Tandem Queue Consisting of a Finite Number of Stations , 2012, CN.

[5]  Peter G. Taylor,et al.  Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes , 1995 .

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

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

[8]  A. Krishnamoorthy,et al.  Analysis of a multi-server retrial queue with search of customers from the orbit , 2006, Perform. Evaluation.

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

[10]  Alexander N. Dudin,et al.  On a BMAP/G/1 Retrial System with Two Types of Search of Customers from the Orbit , 2013 .

[11]  V. C. Joshua,et al.  A Retrial Queueing System with Abandonment and Search for Priority Customers , 2017 .

[12]  Achyutha Krishnamoorthy,et al.  An M|G|1 Retrial Queue with Nonpersistent Customers and Orbital Search , 2005 .

[13]  Vaidyanathan Ramaswami,et al.  Introduction to Matrix Analytic Methods in Stochastic Modeling , 1999, ASA-SIAM Series on Statistics and Applied Mathematics.

[14]  Jesus R. Artalejo,et al.  Accessible bibliography on retrial queues: Progress in 2000-2009 , 2010, Math. Comput. Model..

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

[16]  Jesús R. Artalejo,et al.  A classified bibliography of research on retrial queues: Progress in 1990–1999 , 1999 .

[17]  Gennadi Falin,et al.  A survey of retrial queues , 1990, Queueing Syst. Theory Appl..

[18]  Antonio Gómez-Corral,et al.  A Tandem Queue with Blocking and Markovian Arrival Process , 2002, Queueing Syst. Theory Appl..

[19]  Marcel F. Neuts,et al.  A service model in which the server is required to search for customers , 1984 .