Skip to main content
SpringerLink
Log in

Optimal and Sensitivity Analysis of Vacation Queueing System with F-Policy and Vacation Interruption

  • Research Article-Systems Engineering
  • Published:
Arabian Journal for Science and Engineering Aims and scope Submit manuscript

Abstract

In this article, the investigation on a randomized arrival control policy for the prospective customers in the finite capacity queueing system with working vacation and vacation interruption is done. The impatience behavior of the customers is also considered in modeling and assumptions to the studied problem to make it more realistic. In the investigated queueing model, at the epoch when the number of customers in the system reaches system’s capacity, newly arriving customers are not allowed to join the system for service and referred as lost customers. As the length of the queue decreases to a pre-specified threshold value F, the server commences a start-up for allowing to join the customers according to an exponential distribution and starts allowing newly arriving customers to join the system for service. The steady-state probability distribution and vector representation of various system performance measures are derived using matrix-analytic approach. The cost optimization problem is also formulated, and the particle swarm optimization algorithm is implemented to determine the optimal decision parameters to achieve the minimal expected cost. Finally, some numerical results in tables and graphs are provided for the illustrative and comparative purpose which help the system analyst in decision making from the performance and economic perspective.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Gupta, S.M.: Interrelationship between controlling arrival and service in queueing systems. Comput. Oper. Res. 22(10), 1005–1014 (1995)

    MATH  Google Scholar 

  2. Yadin, M.; Naor, P.: Queueing systems with a removable service station. Oper. Res. Q. 14(4), 393–405 (1963)

    Google Scholar 

  3. Balachandran, K.R.: Control policies for a single server system. Manag. Sci. 19(9), 1013–1018 (1973)

    MathSciNet  MATH  Google Scholar 

  4. Heyman, D.P.: The \(T\)-policy for the \(M/G/1\) queue. Manag. Sci. 23(7), 775–778 (1977)

    MATH  Google Scholar 

  5. Tadj, L.; Choudhury, G.: Optimal design and control of queues. TOP 13(2), 359–412 (2005)

    MathSciNet  MATH  Google Scholar 

  6. Wang, K.H.; Kuo, C.C.; Pearn, W.L.: A recursive method for the \(F\)-policy \(G/M/1/K\) queueing system with an exponential startup time. Appl. Math. Model. 32(6), 958–970 (2008)

    MathSciNet  MATH  Google Scholar 

  7. Chang, C.J.; Ke, J.C.; Huang, H.I.: The optimal management of a queueing system with controlling arrivals. J. Chin. Inst. Ind. Eng. 28(3), 226–236 (2011)

    Google Scholar 

  8. Haight, F.A.: Queueing with balking. Biometrika 44(3/4), 360–369 (1957)

    MathSciNet  MATH  Google Scholar 

  9. Haight, F.A.: Queueing with reneging. Metrika 2(1), 186–197 (1959)

    MathSciNet  MATH  Google Scholar 

  10. Ancker, C.J.; Gafarian, A.V.: Some queueing problem with balking and reneging \(I\). Oper. Res. 11(1), 88–100 (1963)

    MATH  Google Scholar 

  11. Ancker, C.J.; Gafarian, A.V.: Some queueing problem with balking and reneging \(II\). Oper. Res. 11(6), 928–937 (1963)

    MATH  Google Scholar 

  12. Finch, P.D.: Deterministic customer impatience in the queueing system \(GI/M/1\). Biometrika 47(1/2), 45–52 (1960)

    MathSciNet  MATH  Google Scholar 

  13. Jaiswal, N.K.: On some waiting line problems. Opsearch (India) 2, 27–43 (1965)

    Google Scholar 

  14. Rao, S.S.: Queueing with balking and reneging in \(M/G/1\) systems. Metrika 12(1), 173–188 (1968)

    MATH  Google Scholar 

  15. Abou-El-Ata, M.O.; Shawky, A.l: The single-server Markovian overflow queue with balking, reneging and an additional server for longer queues. Microelectr. Reliab. 32(10), 1389–1394 (1992)

    Google Scholar 

  16. Liou, C.D.: Markovian queue optimisation analysis with an unreliable server subject to working breakdowns and impatient customers. Int. J. Syst. Sci. 46(12), 2165–2182 (2015)

    MathSciNet  MATH  Google Scholar 

  17. Shekhar, C.; Jain, M.; Raina, A.A.; Mishra, R.P.: Sensitivity analysis of repairable redundant system with switching failure and geometric reneging. Decis. Sci. Lett. 6(4), 337–350 (2017)

    Google Scholar 

  18. Servi, L.D.; Finn, S.G.: \(M/M/1\) queues with working vacations. Perform. Eval. 50(1), 41–52 (2002)

    Google Scholar 

  19. Liu, W.Y.; Xu, X.L.; Tian, N.S.: Stochastic decompositions in the \(M/M/1\) queue with working vacations. Oper. Res. Lett. 35(5), 595–600 (2007)

    MathSciNet  MATH  Google Scholar 

  20. Lin, C.H.; Ke, J.C.: Multi-server system with single working vacation. Appl. Math. Model. 33(7), 2967–2977 (2009)

    MathSciNet  MATH  Google Scholar 

  21. Zhang, M.; Hou, Z.: \(M/G/1\) queue with single working vacation. J. Appl. Math. Comput. 39(1/2), 221–234 (2012)

    MathSciNet  MATH  Google Scholar 

  22. Yang, D.Y.; Wu, C.H.: Cost minimization analysis of a working vacation queue with \(N\)-policy and server breakdowns. Comput. Ind. Eng. 82, 151–158 (2015)

    Google Scholar 

  23. Ye, Q.; Liu, L.: The analysis of the \(M/M/1\) queue with two vacation policies \((M/M/1/SWV+MV)\). Int. J. Comput. Math. 94(1), 115–134 (2017)

    MathSciNet  Google Scholar 

  24. Shekhar, C.; Raina, A.A.; Kumar, A.; Iqbal, J.: A survey on queues in machining system: Progress from 2010 to 2017. Yugosl. J. Oper. Res. 27(4), 391–413 (2017)

    MathSciNet  Google Scholar 

  25. Li, J.H.; Tian, N.S.: The \(M/M/1\) queue with working vacations and vacation interruptions. J. Syst. Sci. Syst. Eng. 16(1), 121–127 (2007)

    MATH  Google Scholar 

  26. Zhang, M.; Hou, Z.T.: Performance analysis of \(M/G/1\) queue with working vacations and vacation interruption. J. Comput. Appl. Math. 234(10), 2977–2985 (2010)

    MathSciNet  MATH  Google Scholar 

  27. Baba, Y.: The \(M/PH/1\) queue with working vacations and vacation interruption. J. Syst. Sci. Syst. Eng. 19(4), 496–503 (2010)

    Google Scholar 

  28. Zhang, M.; Hou, Z.T.: Performance analysis of \(MAP/G/1\) queue with working vacations and vacation interruption. Appl. Math. Model. 35(4), 1551–1560 (2011)

    MathSciNet  MATH  Google Scholar 

  29. Gao, S.; Liu, Z.M.: An \(M/G/1\) queue with single working vacation and vacation interruption under Bernoulli schedule. Appl. Math. Model. 37(3), 1564–1579 (2013)

    MathSciNet  MATH  Google Scholar 

  30. Gao, S.; Yin, C.C.: Discrete-time \(Geo^{X}/G/1\) queue with geometrically working vacations and vacation interruption. Qual. Technol. Quant. Manag. 10(4), 423–442 (2013)

    Google Scholar 

  31. Gao, S.; Wang, J.T.: Discrete-time \(Geo^{X}/G/1\) retrial queue with general retrial times, working vacations and vacation interruption. Qual. Technol. Quant. Manag. 10(4), 495–512 (2013)

    Google Scholar 

  32. Gao, S.; Liu, Z.M.; Du, Q.W.: Discrete-time \(GI^{X}/Geo/1/N\) queue with working vacation and vacation interruption. Asia Pac. J. Oper. Res. 31(1), 145003 (2014)

    MATH  Google Scholar 

  33. Liou, C.D.; Wang, K.H.; Liou, M.W.: Genetic algorithm to the machine repair problem with two removable servers operating under the triadic \((0; Q; N; M)\) policy. Appl. Math. Model. 37(18–19), 8419–8430 (2013)

    MathSciNet  MATH  Google Scholar 

  34. Bulatović, R.R.; Bordević, S.R.; Dordević, V.S.: Cuckoo search algorithm: a meta-heuristic approach to solving the problem of optimum synthesis of a six-bar double dwell linkage. Mech. Mach. Theory 61(1), 1–3 (2013)

    Google Scholar 

  35. Yang, X.S.: Cuckoo Search and Firefly Algorithm: Theory and Applications, Studies in Computational Intelligence. Springer, Heidelberg (2013)

    Google Scholar 

  36. Kennedy, J.; Eberhart, R.: Particle swarm optimization in Neural Networks. Proc. IEEE Int. Conf. 4, 1942–1948 (1995)

    Google Scholar 

  37. Neuts, M.F.: Matrix Geometric Solutions in Stochastic Models: An Algorithmic Approach. The John Hopkins University Press, Baltimore (1981)

    MATH  Google Scholar 

  38. Shi, Y.; Eberhart, R.: A modified particle swarm optimizer, in IEEE international conference on evolutionary computation proceedings, pp. 69–73. IEEE World Congress on Computational Intelligence, USA (1998)

  39. Yang, X.S.: Nature-Inspired Optimization Algorithm. Elsevier, London (2014)

    MATH  Google Scholar 

Download references

Funding

Funding was provided by Council of Scientific and Industrial Research (Grant No. SRF/Net (09/719(0068)/2015-EMR-1)).

Author information

Authors and Affiliations

  1. Department of Mathematics, Birla Institute of Technology and Science Pilani, Pilani Campus, Pilani, Rajasthan, 333 031, India

    Chandra Shekhar & Shreekant Varshney

  2. Department of Mathematics, Faculty of Science, Shree Guru Gobind Singh Tricentenary University, Gurgaon, Haryana, 122 505, India

    Amit Kumar

Authors
  1. Chandra Shekhar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shreekant Varshney
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Amit Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chandra Shekhar.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shekhar, C., Varshney, S. & Kumar, A. Optimal and Sensitivity Analysis of Vacation Queueing System with F-Policy and Vacation Interruption. Arab J Sci Eng 45, 7091–7107 (2020). https://doi.org/10.1007/s13369-020-04690-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13369-020-04690-5

Keywords

Search

Navigation