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.
Mots clés : 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 - Recherche Op\'erationnelle}, pages = {61--77}, publisher = {EDP-Sciences}, volume = {52}, number = {1}, year = {2018}, doi = {10.1051/ro/2018006}, zbl = {1394.60093}, mrnumber = {3812469}, language = {en}, url = {http://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 - Recherche Opérationnelle PY - 2018 SP - 61 EP - 77 VL - 52 IS - 1 PB - EDP-Sciences UR - http://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 - Recherche Opérationnelle %D 2018 %P 61-77 %V 52 %N 1 %I EDP-Sciences %U http://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 - Recherche Opérationnelle, Tome 52 (2018) no. 1, pp. 61-77. doi : 10.1051/ro/2018006. http://www.numdam.org/articles/10.1051/ro/2018006/
[1] Modeling traffic flow interruped by incidents. Eur. J. Oper. Res. 195 (2009) 127–138. | DOI | MR | Zbl
, and ,[2] Characterization and computation of optimal policies for operating an M/G/1 queueing system with removable server. Oper. Res. 19 (1971) 208–218. | DOI | Zbl
,[3] Markov-modulated infinite-server queues with general service times. Queue. Syst. 76 (2014) 403–424. | DOI | MR | Zbl
, and ,[4] The M/G/1 queue with two service speeds. Adv. Appl. Probab. 33 (2001) 520–540. | MR | Zbl
and ,[5] The unreliable M/M/1 retrial queue in a random environment. Stoch. Model. 28 (2012) 29–48. | DOI | MR | Zbl
and ,[6] Queueing systems with vacations – a survey. Queue. Syst. 1 (1986) 29–66. | DOI | MR | Zbl
,[7] The M/M/∞ queue in random environment. Queue. Syst. 58 (2008) 65–76. | DOI | MR | Zbl
,[8] Stochastic decomposition in the M/G/1 queue with generalized vacations. Oper. Res. 33 (1985) 1117–1129. | DOI | MR | Zbl
and ,[9] Optimal operating policies for M/G/1 queueing system. Oper. Res. 16 (1968) 362–382. | DOI | Zbl
,[10] Generalized Pollaczek-Khinchin formula for Markov channels. IEEE Trans. Commun. 61 (2013) 3530–3540. | DOI
and ,[11] Analysis of the M/G/1 queueing systme with Min(N, V)-policy. Oper. Res. Manag. Sci. (Chin.) 15 (2006) 53–58.
, and ,[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] A recursive method for the N policy G/M/1 queueing system with fnite capacity. Eur. J. Oper. Res. 142 (2002) 577–594. | DOI | MR | Zbl
and ,[14] Recent developments in vacation queueing models: a short survey. Int. J. Oper. Res. 7 (2010) 3–8.
, and ,[15] The threshold policy in the M/G/1 queue with server vacations. Nav. Res. Logist. 36 (1989) 111–123. | DOI | MR | Zbl
,[16] A single server queue with Markov modulated service rates and impatient customers. Perform. Eval. 83–84 (2015) 1–15. | DOI
and ,[17] Batch arrival queue with N-policy and single vacation. Comput. Oper. Res. 22 (1995) 173–189. | DOI | Zbl
, , and ,[18] Performance analysis of a complex queueing system with vacations in random environment. Adv. Mech. Eng. 9 (2017) 1–9.
and ,[19] Analysis of the M/G/1 queue with vacations and multiple phases of operation. Math. Methods Oper. Res. 28 (2018) 51–72. | DOI | MR | Zbl
, and ,[20] The M/M/C queueing system in a random environment. J. Math. Anal. Appl. 436 (2016) 556–567. | DOI | MR | Zbl
and ,[21] A queue subject to extraneous phase changes. Adv. Appl. Probab. 3 (1971) 78–119. | DOI | MR | Zbl
,[22] A queue with service interruptions in an alternating random environment. Oper. Res. 38 (1990) 308–318. | DOI | MR | Zbl
,[23] On stochastic decomposition in M/G/1 tpye queues with generilized server vacations. Oper. Res. 36 (1988) 566–569. | DOI | MR | Zbl
,[24] Queueing Analysis: A Foundation of Performance Evaluation Vol. 1. North-Holland, Amsterdam (1991). | MR | Zbl
,[25] Vacation Queueing Models–Theory and Applications. Springer-Verlag, New York (2006). | DOI | MR | Zbl
and ,[26] Stochastic Modelling and Analysis. Wiley, New York (1986). | MR
,[27] 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. | DOI | Zbl
and ,[28] 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. | DOI | Zbl
, and ,[29] Analysis of an M/G/1 queue with N-policy, single vacation, unreliable service station and replaceable repair facility. Opsearch 52 (2015) 670–691. | DOI | MR | Zbl
, and ,[30] Queueing systems with a removable service station. Opl. Res. Q. 14 (1963) 393–405. | DOI
and ,[31] Queueing problems with heterogeneous arrivals and service. Oper. Res. 19 (1971) 722–734. | DOI | MR | Zbl
and ,[32] The N threshold policy for the GI/M/1 queue. Oper. Res. Lett. 32 (2004) 77–84. | DOI | MR | Zbl
and ,Cité par Sources :