Abstract
This paper studies an M/M/1 queue with single, multiple working vacations and customers’ variant impatient behavior. During working vacations, the arriving customers are served with slower service rate than the service rate of non-vacation period. An arriving customer, during working vacation, finds the system empty and gets his service immediately, does not become impatient. The only customers who are waiting for service, during working vacation, become impatient. The transient system size probabilities of this model are derived explicitly in the closed form using continued fraction. The time-dependent mean and variance are also computed. Numerical examples are provided to visualize the analytical results.
Similar content being viewed by others
Change history
30 October 2019
The editor has retracted this article [1] because it has significant overlap with a work published by Sudhesh and Azhagappan [2] and is therefore redundant. The authors do not agree to this retraction.
30 October 2019
The editor has retracted this article [1] because it has significant overlap with a work published by Sudhesh and Azhagappan [2] and is therefore redundant. The authors do not agree to this retraction.
References
Altman, E., Yechiali, U.: Analysis of customers’ impatience in queues with server vacation. Queueing Syst. 52, 261–279 (2006)
Ammar, S.I.: Transient analysis of an M/M/1 queue with impatient behavior and multiple vacations. Appl. Math. Comput. 260, 97–105 (2015)
Choi, B.D., Kim, B., Chung, J.: M/M/1 queue with impatient customers of higher priority. Queueing Syst. 38, 49–66 (2001)
Choudhury, A.: Impatience in single server queuing model. Am. J. Math. Manag. Sci. 28, 177–211 (2008)
Gradshteyn, I., Ryzhik, I., Jeffrey, A., Zwillinger, D.: Table of Integrals, Series and Products, 7th edn. Academic Press, Elsevier, Cambridge (2007)
Kalidass, K., Ramanath, K.: Transient analysis of an M/M/1 queue with multiple vacations. Pak. J. Stat. Oper. Res. 10, 121–130 (2014)
Kim, B., Kim, J.: A single server queue with Markov modulated service rates and impatient customers. Perform. Eval. 83–84, 1–15 (2015)
Li, J., Tian, N.: The M/M/1 queue with working vacations and vacation interruptions. J. Syst. Sci. Syst. Eng. 16(1), 121–127 (2007)
Parthasarathy, P.R.: A transient solution to an M/M/1 queue: a simple approach. Adv. Appl. Probab. 19(4), 997–998 (1987)
Perel, N., Yechiali, U.: Queues with slow servers and impatient customers. Eur. J. Oper. Res. 201, 247–258 (2010)
Selvaraju, N., Goswami, Cosmika: Impatient customers in an M/M/1 queue with single and multiple working vacations. Comput. Ind. Eng. 65, 207–215 (2013)
Servi, L.D., Finn, S.G.: M/M/1 queue with working vacations (M/M/1/WV). Perform. Eval. 50, 41–52 (2002)
Sudhesh, R.: Transient analysis of a queue with system disasters and customer impatience. Queueing Syst. 66, 95–105 (2010)
Sudhesh, R., Raj, L.F.: Computational analysis of stationary and transient distribution of single server queue with working vacation. Global Trends Comput. Commun. Syst. Commun. Comput. Inf. Sci. 269, 480–489 (2012)
Tian, N., Zhao, X., Wang, K.: The M/M/1 queue with single working vacation. Int. J. Inf. Manag. Sci. 19, 621–634 (2008)
Vijaya Laxmi, P., Jyothsna, K.: Analysis of finite buffer renewal input queue with balking and multiple working vacations. Opsearch 50(4), 548–565 (2013)
Vijaya Laxmi, P., Jyothsna, K.: Impatient customer queue with Bernoulli schedule vacation interruption. Comput. Oper. Res. 56, 1–7 (2015)
Xiu, C., Tian, N., Liu, Y.: The M/M/1 queue with single working vacation serving at a slower rate during the start-up period. J. Math. Res. 2, 98–102 (2010)
Yechiali, U.: Queues with system disasters and impatient customers when system is down. Queueing Syst. 56, 195–202 (2007)
Yue, D., Yue, W., Xu, G.: Analysis of a queueing system with impatient customers and working vacations. In: Proceedings of the 6th international conference on queueing theory and network applications, pp. 208–211 (2011)
Author information
Authors and Affiliations
Corresponding author
Additional information
The editor has retracted this article [1] because it has significant overlap with a work published by Sudhesh and Azhagappan [2] and is therefore redundant. The authors do not agree to this retraction.
[1] Sudhesh, R. and Azhagappan, A. OPSEARCH (2018) 55: 787. https://doi.org/10.1007/s12597-018-0339-8
[2] Sudhesh, R and Azhagappan, A. Asian Journal of Research in Social Sciences and Humanities. (2016) ;6(9):1096-104. https://doi.org/10.5958/2249-7315.2016.00857.1
Appendices
Appendix A
Proof of Theorem 1
Let
From (2.4), we obtain
Solving the partial differential equation (6.1) yields,
It is well known that, if \( \alpha = 2 \sqrt{\lambda \mu _{b}} \) and \( \beta =\sqrt{\frac{\lambda }{\mu _{b}}} \), then
Using (6.3) in (6.2), for \(n=1, 2, 3, \ldots \), we get
The above equation holds for \(n = -1, -2, -3, \ldots ,\) with the left hand side replaced by zero. Using \( I_{-n}(x)= I_{n}(x)\), for \(n = 1, 2, 3,\ldots ,\)
From (6.4) and (6.5), we obtain (2.5), for \(n = 1, 2, 3, \ldots .\)
Evaluation of \( P_{1,0}(t) \)
Let \({\hat{f}}(s)\) represents the Laplace transform of f(t). Taking Laplace transforms on (2.3), we get
Laplace inversion of the above equation yields (2.6). Thus, we have expressed the probabilities \( P_{b,n}(t) \) in terms of \( P_{v,n}(t) \) and \( P_{b,0}(t) \), for \(n = 1, 2, 3, \ldots \) and \(P_{b,0}(t)\) is obtained in terms of \(P_{v,0}(t)\). \(\square \)
Appendix B
Proof of Theorem 2
Taking Laplace transform on (2.1) and (2.2), we get
Solving (6.7), for \(n = 1, 2, 3, \ldots \), we obtain
On Laplace inversion, we get (2.7). Using (2.5) and (6.7) for \(n = 1,\) in (6.6), we obtain
where
After some manipulations yield,
On Laplace inversion, we get (2.8). From (6.8), we obtain
Using the definition of confluent hypergeometric functions, we obtain
Applying partial fraction in the above equation, we get
Further,
where
Using partial fractions, for \(k \ge 1\), we have
Using the identity given in [5], we obtain
where \( {\hat{\chi }}_{0}(s)= 1 \) and for \(k = 1, 2, 3, \ldots \),
Substitute (6.13) and (6.15) in (6.11), we get
On taking inverse Laplace transforms, we get (2.9). Thus, we have obtained the time-dependent system size probabilities \(P_{v,n}(t) \) in terms of \(P_{v,0}(t)\), for \(n = 1, 2, 3, \ldots \) and \(P_{v,0}(t)\) is derived explicitly. \(\square \)
Appendix C
Proof of Theorem 3
Define
From (4.3) and (4.4), we obtain
Using the methodology given in the proof of Theorem 1, we obtain \( P_{b,n}(t) \) which resemble with (4.5), for \(n = 1, 2, 3, \ldots \). Thus, we have derived the probabilities \( P_{b,n}(t) \) as a function of the probabilities \( P_{v,n}(t) \), for \(n = 1, 2, 3, \ldots .\) \(\square \)
Appendix D
Proof of Theorem 4
Taking Laplace transform on (4.1), we get
Using (4.5) and (6.8) for \(n = 1,\) in (6.19), we obtain
Algebraic simplification yields,
where \(d_{2}\) is as in (6.9). On Laplace inversion, we get (4.6). \(\square \)
About this article
Cite this article
Sudhesh, R., Azhagappan, A. RETRACTED ARTICLE: Transient analysis of an M/M/1 queue with variant impatient behavior and working vacations. OPSEARCH 55, 787–806 (2018). https://doi.org/10.1007/s12597-018-0339-8
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12597-018-0339-8