envIn this paper, we analyze an queue operating in multi-phase random environment with vacation policy. In operative phase customers are served according to the discipline of First Come First Served (FCFS). When the system becomes empty, the server takes a vacation under the policy, causing the system to move to vacation phase . At the end of a vacation, if the server finds no customer waiting, another vacation begins. Otherwise, the system jumps from the phase to some operative phase with probability . And whenever the number of the waiting customers in the system reaches , the server interrupts its vacation immediately and the system jumps from the phase to some operative phase with probability , too. Using the method of supplementary variable, we derive the distribution for the stationary system size at arbitrary epoch. We also obtain mean system size, the results of the cycle analysis and the sojourn time distribution. In addition, some special cases and numerical examples are presented.
Keywords: MβGβ1 queue, vacation, sojourn time, Min(N, V) policy, random environment, queueing theory
@article{RO_2018__52_1_61_0,
author = {Li, Jianjun and Liu, Liwei},
title = {On an $M / G / 1$ queue in random environment with $Min (N , V)$ policy},
journal = {RAIRO. Operations Research},
pages = {61--77},
year = {2018},
publisher = {EDP-Sciences},
volume = {52},
number = {1},
doi = {10.1051/ro/2018006},
zbl = {1394.60093},
mrnumber = {3812469},
language = {en},
url = {https://www.numdam.org/articles/10.1051/ro/2018006/}
}
TY - JOUR AU - Li, Jianjun AU - Liu, Liwei TI - On an $M / G / 1$ queue in random environment with $Min (N , V)$ policy JO - RAIRO. Operations Research PY - 2018 SP - 61 EP - 77 VL - 52 IS - 1 PB - EDP-Sciences UR - https://www.numdam.org/articles/10.1051/ro/2018006/ DO - 10.1051/ro/2018006 LA - en ID - RO_2018__52_1_61_0 ER -
%0 Journal Article %A Li, Jianjun %A Liu, Liwei %T On an $M / G / 1$ queue in random environment with $Min (N , V)$ policy %J RAIRO. Operations Research %D 2018 %P 61-77 %V 52 %N 1 %I EDP-Sciences %U https://www.numdam.org/articles/10.1051/ro/2018006/ %R 10.1051/ro/2018006 %G en %F RO_2018__52_1_61_0
Li, Jianjun; Liu, Liwei. On an $M / G / 1$ queue in random environment with $Min (N , V)$ policy. RAIRO. Operations Research, Volume 52 (2018) no. 1, pp. 61-77. doi: 10.1051/ro/2018006
[1] , and , Modeling traffic flow interruped by incidents. Eur. J. Oper. Res. 195 (2009) 127β138. | Zbl | MR | DOI
[2] , Characterization and computation of optimal policies for operating an M/G/1 queueing system with removable server. Oper. Res. 19 (1971) 208β218. | Zbl | DOI
[3] , and , Markov-modulated infinite-server queues with general service times. Queue. Syst. 76 (2014) 403β424. | Zbl | MR | DOI
[4] and , The M/G/1 queue with two service speeds. Adv. Appl. Probab. 33 (2001) 520β540. | Zbl | MR
[5] and , The unreliable M/M/1 retrial queue in a random environment. Stoch. Model. 28 (2012) 29β48. | Zbl | MR | DOI
[6] , Queueing systems with vacations β a survey. Queue. Syst. 1 (1986) 29β66. | Zbl | MR | DOI
[7] , The M/M/β queue in random environment. Queue. Syst. 58 (2008) 65β76. | Zbl | MR | DOI
[8] and , Stochastic decomposition in the M/G/1 queue with generalized vacations. Oper. Res. 33 (1985) 1117β1129. | Zbl | MR | DOI
[9] , Optimal operating policies for M/G/1 queueing system. Oper. Res. 16 (1968) 362β382. | Zbl | DOI
[10] and , Generalized Pollaczek-Khinchin formula for Markov channels. IEEE Trans. Commun. 61 (2013) 3530β3540. | DOI
[11] , and , Analysis of the M/G/1 queueing systme with Min(N, V)-policy. Oper. Res. Manag. Sci. (Chin.) 15 (2006) 53β58.
[12] ,The optimal control of an M/G/1 queueing system with server vacations, startup and breakdowns. Comput. Ind. Eng. 44 (2003) 567β579. | DOI
[13] and , A recursive method for the N policy G/M/1 queueing system with fnite capacity. Eur. J. Oper. Res. 142 (2002) 577β594. | Zbl | MR | DOI
[14] , and , Recent developments in vacation queueing models: a short survey. Int. J. Oper. Res. 7 (2010) 3β8.
[15] , The threshold policy in the M/G/1 queue with server vacations. Nav. Res. Logist. 36 (1989) 111β123. | Zbl | MR | DOI
[16] and , A single server queue with Markov modulated service rates and impatient customers. Perform. Eval. 83β84 (2015) 1β15. | DOI
[17] , , and , Batch arrival queue with N-policy and single vacation. Comput. Oper. Res. 22 (1995) 173β189. | Zbl | DOI
[18] and , Performance analysis of a complex queueing system with vacations in random environment. Adv. Mech. Eng. 9 (2017) 1β9.
[19] , and , Analysis of the M/G/1 queue with vacations and multiple phases of operation. Math. Methods Oper. Res. 28 (2018) 51β72. | Zbl | MR | DOI
[20] and , The M/M/C queueing system in a random environment. J. Math. Anal. Appl. 436 (2016) 556β567. | Zbl | MR | DOI
[21] , A queue subject to extraneous phase changes. Adv. Appl. Probab. 3 (1971) 78β119. | Zbl | MR | DOI
[22] , A queue with service interruptions in an alternating random environment. Oper. Res. 38 (1990) 308β318. | Zbl | MR | DOI
[23] , On stochastic decomposition in M/G/1 tpye queues with generilized server vacations. Oper. Res. 36 (1988) 566β569. | Zbl | MR | DOI
[24] , Queueing Analysis: A Foundation of Performance Evaluation Vol. 1. North-Holland, Amsterdam (1991). | Zbl | MR
[25] and , Vacation Queueing ModelsβTheory and Applications. Springer-Verlag, New York (2006). | Zbl | MR | DOI
[26] , Stochastic Modelling and Analysis. Wiley, New York (1986). | MR
[27] and , A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity. Appl. Math. Model. 24 (2000) 899β914. | Zbl | DOI
[28] , and , Optimal control of the N policy M/G/1 queueing system with server breakdowns and general startup times. Appl. Math. Model. 31 (2007) 2199β2212. | Zbl | DOI
[29] , and , Analysis of an M/G/1 queue with N-policy, single vacation, unreliable service station and replaceable repair facility. Opsearch 52 (2015) 670β691. | Zbl | MR | DOI
[30] and , Queueing systems with a removable service station. Opl. Res. Q. 14 (1963) 393β405. | DOI
[31] and , Queueing problems with heterogeneous arrivals and service. Oper. Res. 19 (1971) 722β734. | Zbl | MR | DOI
[32] and , The N threshold policy for the GI/M/1 queue. Oper. Res. Lett. 32 (2004) 77β84. | Zbl | MR | DOI
Cited by Sources:





