In this paper, an M/G/1 retrial queue with general retrial times and single working vacation is considered. We assume that the customers who find the server busy are queued in the orbit in accordance with a first-come-first-served (FCFS) discipline and only the customer at the head of the queue is allowed access to the server. During the normal period, if the orbit queue is not empty at a service completion instant, the server begins a working vacation with specified probability q (0 ≤ q ≤ 1), and with probability 1 − q, he waits for serving the next customer. During the working vacation period, customers can be served at a lower service rate. We first present the necessary and sufficient condition for the system to be stable. Using the supplementary variable method, we deal with the generating functions of the server state and the number of customers in the orbit. Various interesting performance measures are also derived. Finally, some numerical examples and cost optimization analysis are presented.
Mots-clés : Retrial, working vacation, Bernoulli, embedded Markov chain, supplementary variable method
@article{RO_2020__54_2_471_0, author = {Li, Tao and Zhang, Liyuan and Gao, Shan}, title = {An {M/G/1} retrial queue with single working vacation under {Bernoulli} schedule}, journal = {RAIRO - Operations Research - Recherche Op\'erationnelle}, pages = {471--488}, publisher = {EDP-Sciences}, volume = {54}, number = {2}, year = {2020}, doi = {10.1051/ro/2019008}, mrnumber = {4070784}, zbl = {1434.60264}, language = {en}, url = {http://archive.numdam.org/articles/10.1051/ro/2019008/} }
TY - JOUR AU - Li, Tao AU - Zhang, Liyuan AU - Gao, Shan TI - An M/G/1 retrial queue with single working vacation under Bernoulli schedule JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2020 SP - 471 EP - 488 VL - 54 IS - 2 PB - EDP-Sciences UR - http://archive.numdam.org/articles/10.1051/ro/2019008/ DO - 10.1051/ro/2019008 LA - en ID - RO_2020__54_2_471_0 ER -
%0 Journal Article %A Li, Tao %A Zhang, Liyuan %A Gao, Shan %T An M/G/1 retrial queue with single working vacation under Bernoulli schedule %J RAIRO - Operations Research - Recherche Opérationnelle %D 2020 %P 471-488 %V 54 %N 2 %I EDP-Sciences %U http://archive.numdam.org/articles/10.1051/ro/2019008/ %R 10.1051/ro/2019008 %G en %F RO_2020__54_2_471_0
Li, Tao; Zhang, Liyuan; Gao, Shan. An M/G/1 retrial queue with single working vacation under Bernoulli schedule. RAIRO - Operations Research - Recherche Opérationnelle, Tome 54 (2020) no. 2, pp. 471-488. doi : 10.1051/ro/2019008. http://archive.numdam.org/articles/10.1051/ro/2019008/
[1] An M/G/1 retrial queue with working vacation. In: Proceedings of the International Conference on Systems Science 2013, edited by . Springer International Publishing, Poland (2013) 443–452. | Zbl
, , , and ,[2] The retrial queue with Bernoulli schedules and general retrial times. Comput. Math. Appl. 43 (2002) 15–30. | DOI | MR | Zbl
and ,[3] On the MX/G/1 retrial queue with Bernoulli schedules and general retrial times. Asia Pac. J. Oper. Res. 19 (2002) 177–194. | MR | Zbl
, and ,[4] Performance analysis of a single server retrial queue with working vacation. OPSEARCH 51 (2014) 434–462. | DOI | MR
, and ,[5] An unreliable retrial queue with delaying repair and general retrial times under Bernoulli vacation schedule. Appl. Math. Comput. 230 (2014) 436–450. | MR
and ,[6] An retrial queue with an unreliable server and general repair times. Perform. Eval. 67 (2010) 569–582. | DOI
,[7] Retrial Queues. Chapman & Hall, London (1997). | DOI | Zbl
and ,[8] Oscillating random walk models for GI/G/1 vacation system with Bernoulli schedules. J. Appl. Prob. 23 (1986) 790–802. | DOI | MR | Zbl
and ,[9] Performance analysis of a GI/M/1 queue with single working vacation. Appl. Math. Comput. 217 (2011) 4960–4971. | MR | Zbl
and ,[10] Accessible bibliography on retrial queues: Progress in 2000–2009. Math. Comput. Model. 51 (2010) 1071–1081. | DOI | MR | Zbl
,[11] Retrial Queueing Systems: A Computational Approach. Springer, Berlin (2008). | DOI | Zbl
and ,[12] Discrte-time retrial queues with general retrial time and Bernoulli vacation. J. Syst. Sci. Complex. 25 (2012) 504–513. | DOI | MR | Zbl
,[13] A single-server retrial G-queue with priority and unreliable server under Bernoulli vacation schedule. Comput. Ind. Eng. 64 (2013) 84–93. | DOI
and ,[14] The queue and the queue both with single working vacation. Perform. Eval. 66 (2009) 356–367. | DOI
, and ,[15] queue with working vacations . Perform. Eval. 50 (2002) 41–52. | DOI
and ,[16] M/M/1 retrial queue with collisions and working vacation interruption under N-policy. RAIRO: OR 46 (2012) 355–371. | DOI | Numdam | MR | Zbl
, and ,[17] Structured Stochastic Matrices of M/G/1 Type and Their Applications. Marcel Dekker, New York (1989). | MR | Zbl
,[18] queue with single working vacation, J. Appl. Math. Comput. 39 (2012) 221–234. | DOI | MR | Zbl
and ,[19] Impatient customers in an queue with single and multiple working vacations. Comput. Ind. Eng. 65 (2013) 207–215. | DOI
and ,[20] The queue with single working vacation. Int. J. Infor. Manag. Sci. 19 (2008) 621–634. | MR | Zbl
, and ,[21] Introduction to Queueing Theory. North-Holland, New York (1981). | MR | Zbl
,[22] Poisson arrivals see time averages. Oper. Res. 30 (1982) 223–231. | DOI | MR | Zbl
,[23] Discrete-time GeoX/G/1 retrial queue with general retrial times, working vacations and vacation interruption. Qual. Technol. Quant. M. 10 (2013) 493–510.
, ,[24] An M/G/1 retrial queue with general retrial times, working vacations and vacation interruption. Asia Pac. J. Oper. Res. 31 (2014) 25. | MR | Zbl
, and ,[25] An queue with single working vacation and vacation interruption under Bernoulli schedule. Appl. Math. Model. 37 (2013) 1564–1579. | DOI | MR | Zbl
, ,[26] Working vacation policy for a discrete-time retrial queue. OPSEARCH 52 (2015) 650–669. | DOI | MR | Zbl
,[27] retrial queue with working vacations, Acta Inform. 47 (2010) 67–75. | DOI | MR | Zbl
,[28] Performance analysis of single server non-Markovian retrial queue with working vacation and constant retrial policy. RAIRO: OR 48 (2014) 381–398. | DOI | Numdam | MR | Zbl
, and ,[29] Analysis of a single-server retrial queue with FCFS orbit and Bernoulli vacation. Appl. Math. Comput. 161 (2005) 353–364. | MR | Zbl
,Cité par Sources :