Analysis of a single server batch arrival retrial queueing system with modified vacations and N-policy

Haridass, M.; Arumuganathan, R.

RAIRO - Operations Research - Recherche Opérationnelle, Tome 49 (2015) no. 2, pp. 279-296.

In this paper, a batch arrival single server retrial queue with modified vacations under $N$-policy is considered. If an arriving batch of customers finds the server busy or on vacation, then the entire batch joins the orbit in order to seek the service again. Otherwise, one customer from the arriving batch receives the service, while the rest joins the orbit. The customers in the orbit will try for service one by one when the server is idle with a classical retrial policy with the retrial rate ‘$jv$’, where ‘$j$’ is the size of the orbit. At a service completion epoch, if the number of customers in the orbit is zero, then the server leaves for a secondary job (vacation) of random length. At a vacation completion epoch, if the orbit size is at least $N$, then the server remains in the system to render service for the primary customers or orbital customers. On the other hand, if the number of customers in the orbit is less than ‘$N$’ at a vacation completion epoch, the server avails multiple vacations subject to maximum ‘$M$’ repeated vacations. After availing ‘$M$’ consecutive vacations, the server returns to the system to render service irrespective of the orbit size. The model is studied using supplementary variable technique. For the proposed queueing system, the probability generating function of the steady state queue size distribution at an arbitrary time is obtained. Various performance measures are derived. A cost model for the queueing system is developed. Numerical illustration is provided.

Classification : 60K25, 60K20, 90B22, 68M20
Mots clés : Batch arrival, retrial queue, modified vacations, Npolicy, classical retrial policy

A. Aissani, An $M^x/G/1$ energetic retrial queue with vacations and control. IMA J. Manag. Math. 22 (2011) 13–32. | DOI | Zbl

A.M. Aleksandrov, A queueing system with repeated orders. Eng. Cybernet. 12 (1974) 1–4.

J.R. Artalejo, Some results on $M/G/$1 queue with $N$-policy. Asia-pac. J. Opnl. Res. 15 (1998) 147–157. | Zbl

J.R. Artalejo, Accessible bibliography on retrial queues. Math. Comput. Modell. 30 (1999) 1–6. | DOI

J.R. Artalejo, A classified bibliography of research on retrial queues: progress in 1990–1999. Top 7 (1999) 187–211. | DOI | Zbl

R. Arumuganathan and S. Jeyakumar, Steady state analysis of a bulk queue with multiple vacations, setup times with $N$-policy and closedown times. Appl. Math. Modell. 29 (2005) 972–986. | DOI | Zbl

G. Choudhury, T. Lotfi and D. Kandarpa, A batch arrival retrial queueing system with two phases of service and service interruption. Comput. Math. Appl. 59 (2010) 437–450. | DOI | Zbl

D.R. Cox, The analysis of Non-Markovian stochastic processes by the inclusion of Supplementary variables. Proc. Camb Phil. Soc. 51 (1955) 433–441. | DOI | Zbl

G.I. Falin, Aggregate arrival of customers in one line queue with repeated calls. Ukrainian Math J. 28 (1976) 437–440. | DOI | Zbl

G.I. Falin and J.G.C. Templeton, Retrial Queues. Chapman and Hall, London (1997). | Zbl

F.-M. Chang and J.C. Ke, On a batch retrial model with J vacations. J. Comput. Appl. Math. 232 (2009) 402–414. | DOI | Zbl

G. Choudhury, Steady state analysis of an $M/G$/1 queue with linear retrial policy and two phase service under Bernoulli vacation schedule. Appl. Math. Modell. 32 (2008) 2480–2489. | DOI | Zbl

M. Haridass and R. Arumuganathan, Analysis of a $M^X/G(a,b)/1$ queueing system with vacation interruption. RAIRO Oper. Res. 46 (2012) 304–334. | DOI | Numdam | Zbl

J.C. Ke, Operating characteristic analysis on the $M^x/G/1$ system with a variant vacation policy and balking. Appl. Math. Model. 31 (2007) 1321–1337. | DOI | Zbl

J.C. Ke and F.-M. Chang, Modified vacation policy for $M/G/$1 retrial queue with balking and feedback. Comput. Indus. Eng. 57 (2009) 433–443. | DOI

J. Keilson, J. Cozzolino and H. Young, A service system with unfilled requests repeated. Oper. Res. 16 (1968) 1126–1137. | DOI | Zbl

G.V. Krishna Reddy, R. Arumuganathan and R. Nadarajan, Analysis of Bulk queue with N policy multiple vacations and setup times. Comput. Oper. Res. 25 (1998) 957–967. | DOI | Zbl

B. Krishnakumar and S. Pavai Madheswari, M^x/G/1 retrial queue with multiple vacations and starting failures. Opsearch 40 (2003) 115–137. | DOI | Zbl

H.S. Lee, Steady state probabilities for the server vacation model with group arrivals and under control operation policy. J. Korean OR/MS Soc. 16 (1991) 36–48.

H.W. Lee, S.S. Lee, J.O. Park and K.C. Chae, Analysis of the $M^X/G/1$ queue with $N$-Policy and multiple vacations. J. Appl. Probab. 31 (1994) 476–496. | Zbl

M.F. Neuts and M.F. Ramalhoto, A service model in which the server is required to search for customers. J. Appl. Probab. 21 (1984) 157–166. | DOI | Zbl

M. Senthil Kumar and R. Arumuganathan, On the single server batch arrival retrial queue with general vacation time under Bernoulli schedule and two phases of heterogeneous service. Quality Technology and Quantitative Management 5 (2008) 145–160. | DOI

L. Zaiming, W. Jinbiao and Y. Gang, An $M/G/1$ retrial $G$-queue with preemptive resume and feedback under $N$-policy subject to the server breakdowns and repairs. Comput. Math. Appl. 58 (2009) 1792–1807. | DOI | Zbl