Main Article Content

Authors

Vinita Yadav

Dr. Naveen Kumar

Abstract

This paper gives a rigorous analytical and numerical examination of single-server retrial queuing systems defined by batch arrivals and server vacation rules. Such models are extremely applicable in service contexts where clients, upon finding the server busy, enter a retry orbit and attempt service after random time periods. The addition of batch arrivals replicates realistic consumer behavior in applications like telephony, manufacturing, and service centers. Server vacations offer another degree of operational complexity, representing circumstances when the server may be offline owing to planned breaks or maintenance.


We establish the mathematical formulation of the system under steady-state circumstances and obtain performance indicators including mean system size, average waiting time, and server usage. Using numerical simulations, we explore the implications of retry rates, batch size distributions, and vacation rules on system performance. The findings give useful insights for enhancing service efficiency and resource allocation. The model acts as a powerful tool for decision-makers intending to boost customer satisfaction and system dependability in retrial-based queueing contexts.

Downloads

Download data is not yet available.

Article Details

Section

Articles

References

  1. Artalejo, J. R., & Gómez-Corral, A. (2008). Retrial Queueing Systems: A Computational Approach. Springer.
  2. Falin, G., & Templeton, J. G. C. (1997). Retrial Queues. Chapman & Hall.
  3. Artalejo, J. R., & Phung-Duc, T. (2013). On the single server retrial queue with vacations and retrial control policy. Applied Mathematical Modelling, 37(4), 1918–1931. https://doi.org/10.1016/j.apm.2012.04.044
  4. Kulkarni, V. G. (1995). Modeling and Analysis of Stochastic Systems. CRC Press.
  5. Chakravarthy, S. R., & Alfa, A. S. (2007). A retrial queue with Bernoulli schedule, general retrial times, and feedback. Queueing Systems, 57(4), 295–319. https://doi.org/10.1007/s11134-007-0016-0
  6. Choi, B. D., & Kim, B. W. (1995). M/G/1 retrial queueing system with batch arrival and server breakdown. Queueing Systems, 20(1), 63–81. https://doi.org/10.1007/BF01160183
  7. Zhang, M., & Hou, Z. (2010). Analysis of M/G/1 retrial queues with two types of vacations. Mathematical and Computer Modelling, 51(5-6), 595–608. https://doi.org/10.1016/j.mcm.2009.09.018
  8. Wang, J., & Zhang, Z. (2015). Performance analysis of retrial queues with batch arrivals and multiple vacations. Computers & Industrial Engineering, 87, 540–547. https://doi.org/10.1016/j.cie.2015.05.026
  9. Mishra, U. K., & Arora, H. (2012). Performance measures of a single server retrial queue with Bernoulli feedback and vacation. Applied Mathematical Modelling, 36(11), 5516–5530. https://doi.org/10.1016/j.apm.2011.11.012
  10. Tian, N., & Zhang, Z. G. (2006). Vacation Queueing Models: Theory and Applications. Springer.
  11. Yang, T., & Li, Q. (2012). M/M/1 retrial queue with working vacations. Applied Mathematical Modelling, 36(5), 2044–2052. https://doi.org/10.1016/j.apm.2011.08.014
  12. Medhi, J. (2003). Stochastic Models in Queueing Theory (2nd ed.). Academic Press.
  13. Jain, N., & Sahu, A. (2014). Analysis of M/M/1 retrial queue with batch arrival and feedback under Bernoulli vacation. International Journal of Operational Research, 21(2), 183–200. https://doi.org/10.1504/IJOR.2014.059390
  14. Borthakur, A., & Sharma, V. (2021). Performance analysis of a batch arrival retrial queue with server vacation and impatient customers. Journal of Industrial and Management Optimization, 17(5), 2499–2515. https://doi.org/10.3934/jimo.2020061
  15. Kim, J., & Kim, B. W. (2001). M/G/1 queue with batch arrivals and multiple working vacations. Queueing Systems, 39(4), 367–385. https://doi.org/10.1023/A:1010953900391
  16. Alfa, A. S. (2015). Queueing Theory for Telecommunications: Discrete Time Modelling of a Single Node System. Springer.
  17. Krishnamoorthy, A., & Ushakumari, P. V. (2012). A single server retrial queue with working vacations and vacation interruption. Mathematical and Computer Modelling, 55(1–2), 242–256. https://doi.org/10.1016/j.mcm.2011.03.027
  18. Wu, J., & Tian, N. (2002). Equilibrium analysis of an M/G/1 retrial queue with vacations. Mathematics and Computers in Simulation, 60(3–5), 323–332. https://doi.org/10.1016/S0378-4754(02)00020-3
  19. Choudhury, G., Tadj, L., & Paul, M. (2009). A batch arrival queue with a vacation policy and a fixed-size buffer. Applied Mathematical Modelling, 33(5), 2431–2441. https://doi.org/10.1016/j.apm.2008.06.012
  20. Kella, O., & Yechiali, U. (1988). Priorities in M/G/1 retrial queues. Advances in Applied Probability, 20(3), 585–600. https://doi.org/10.2307/1427522
  21. Ramachandran, A., & Deepak, T. (2018). M/M/1 retrial queueing system with vacations and feedback: A matrix-analytic approach. International Journal of Operational Research, 31(1), 95–113. https://doi.org/10.1504/IJOR.2018.089137
  22. Singh, S. R., & Jain, M. (2009). Analysis of a retrial queue with two types of batch arrivals and Bernoulli vacation schedule. International Journal of Mathematics in Operational Research, 1(1–2), 164–184. https://doi.org/10.1504/IJMOR.2009.024039
  23. Gupta, U. C., & Banerjee, A. (2010). A study of M/M/1 retrial queue with bulk arrivals and multiple vacations. American Journal of Operations Research, 1(1), 31–38. https://doi.org/10.4236/ajor.2010.11004
  24. Zhang, Z., & Wang, J. (2014). Numerical analysis of a single server retrial queue with Bernoulli vacation and priority service. Operations Research Letters, 42(4), 279–284. https://doi.org/10.1016/j.orl.2014.02.011
  25. Banik, A. D., & Sikdar, K. (2005). A single server retrial queue with batch arrival and Bernoulli feedback. Journal of Applied Mathematics and Stochastic Analysis, 2005(4), 379–398. https://doi.org/10.1155/JAMSA.2005.379