×

Analysis of variant working vacations on batch arrival queues. (English) Zbl 1360.90097

Summary: This paper analyzes a batch arrival infinite-buffer single server queueing system with variant working vacations in which customers arrive according to a Poisson process. As soon as the system becomes empty, the server takes working vacation. The service rate during regular busy period, working vacation period and vacation times are assumed to be exponentially distributed. We derive the probability generating function of the steady-state probabilities and obtain the closed form expressions of the system size when the server is in different states. In addition, we obtain some other performance measures and discuss their monotonicity and a cost model is formulated to determine the optimal service rate during working vacation.

MSC:

90B22 Queues and service in operations research
60K25 Queueing theory (aspects of probability theory)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Baba, Y.: Analysis of a GI/M/1 queue with multiple working vacations. Oper. Res. Lett. 33(2), 201-209 (2005) · Zbl 1099.90013 · doi:10.1016/j.orl.2004.05.006
[2] Baba, Y.: The MX/M/1 queue with multiple working vacation. Am. J. Oper. Res. 2(2), 217-224 (2012) · doi:10.4236/ajor.2012.22025
[3] Banik, A.D., Gupta, U.C., Pathak, S.S.: On the GI/M/1/N queue with multiple working vacations-Analytic analysis and computation. Appl. Math. Model. 31(9), 1701-1710 (2007) · Zbl 1167.90441 · doi:10.1016/j.apm.2006.05.010
[4] Doshi, B.T.: Queueing systems with vacations: a survey. Queueing Syst. 1(1), 29-66 (1986) · Zbl 0655.60089 · doi:10.1007/BF01149327
[5] Kim, J., Choi, B.D., Chae, K.: Analysis of queue-length distribution of the M/G/1 queue with working vacation. International Conference on Statistics and Related fields, Hawaii (2003)
[6] Li, J.H., Tian, N.: The discrete-time GI/Geo/1 queue with working vacations and vacation interruption. Appl. Math. Comput. 185 (1), 1-10 (2007) · Zbl 1183.34055 · doi:10.1016/j.camwa.2006.09.007
[7] Li, J.H., Tian, N., Liu, W.Y.: Discrete-time GI/Geo/1 queue with multiple working vacations. Queueing Syst. 56(1), 53-63 (2007) · Zbl 1177.90095 · doi:10.1007/s11134-007-9030-0
[8] Li, J.H., Tian, N., Zhang, Z.G., Luh, H.P.: Analysis of the M/G/1 queue with exponentially working vacations a matrix analytic approach. Queueing Syst. 61(2), 139-166 (2009) · Zbl 1166.60335 · doi:10.1007/s11134-008-9103-8
[9] Liu, W.Y., Xu, X.L., Tian, N.: Stochastic decompositions in the M/M/1 queue with working vacations. Oper. Res. Lett. 35(5), 595-600 (2007) · Zbl 1129.60085 · doi:10.1016/j.orl.2006.12.007
[10] Rardin, R.L.: Optimization in Operations Research. Prentice Hall, New Jersey (1997)
[11] Servi, L.D., Finn, S.G.: M/M/1 queues with working vacations (M/M/1/WV). Perform. Eval. 50(1), 41-52 (2002) · doi:10.1016/S0166-5316(02)00057-3
[12] Takagi, H.: Queueing Analysis: A Foundation of Performance Evaluation, Vol. 1: Vacation and Priority Systems, Part 1. Elsevier Science Publishers, Amsterdam (1991) · Zbl 0744.60114
[13] Tian, N., Zhang, Z.G.: Vacation queueing models: theory and applications, vol. 93. Springer Science & Business Media (2006) · Zbl 1104.60004
[14] Wu, D., Takagi, H.: M/G/1 queue with multiple working vacations. Perform. Eval. 63(7), 654-681 (2006) · doi:10.1016/j.peva.2005.05.005
[15] Xu, X., Zhang, Z.G., Tian, N.: Analysis for the MX/M/1 working vacation queue. Int. J. Inf. Manag. Sci. 20, 379-394 (2009) · Zbl 1184.90052
[16] Yue, D., Yue, W., Saffer, Z., Chen, X.: Analysis of an M/M/1 queueing system with impatient customers and a variant of multiple vacation policy. J. Ind. Manag. Optim. 10, 89-112 (2014) · Zbl 1277.60163 · doi:10.3934/jimo.2014.10.89
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.