Skip to main content
SpringerLink
Log in

Analysis of a Markovian queue with customer interjections and finite buffer

  • Theoretical Article
  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

This paper studies a finite Markovian queue with customer interjections. Arriving customers are dispersed into normal customers and interjecting customers, the normal customers join the queue at the end and the interjecting customers try to cut in line and occupy a position as close to the head of the queue as possible. The behavior of interjecting customers is described by the percentage of customers interjecting and the tolerance level of interjection by individual customers who are already waiting in the queue. Customers in different positions in the waiting line have different tolerance levels on customer interjection. By using the theory of the exponential distribution, the Laplace–Stieltjes transform and the formula of the total probability, we obtain the mean and variance of waiting time of a customer in position n, a normal customer and an interjecting customer. Further, numerical results show that these means and variances of waiting times increase with increase of the arrival process, and are sensitive to the percentage of customers interjecting and the tolerance level of interjection. It is found that eliminating customer interjection would be beneficial to normal customers.

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

Similar content being viewed by others

References

  1. Larson, R.C.: Perspectives on queues: social justice and the psychology of queueing. Oper. Res. 35(6), 895–905 (1987)

    Article  Google Scholar 

  2. Afèche, P., Mendelson, H.: Pricing and priority auctions in queueing systems with a generalized delay cost structure. Manag. Sci. 50(7), 869–882 (2004)

    Article  Google Scholar 

  3. Kleinrock, L.: Optimum bribing for queue position. Oper. Res. 15(2), 304–318 (1967)

    Article  Google Scholar 

  4. Lui, F.T.: An equilibrium queueing model of bribery. J. Polit. Econ. 93(4), 760–781 (1985)

    Article  Google Scholar 

  5. Boxma, O., Wal, J.V.D., Yechiali, U.: Polling with batch service. Stoch. Models 24(4), 604–625 (2008)

    Article  Google Scholar 

  6. Perel, U., Yechiali, N.: The Israeli queue with priorities. Stoch. Models 29(3), 353–379 (2013)

    Article  Google Scholar 

  7. Perel, N., Yechiali, U.: The Israeli queue with retrials. Queueing Syst. 78(1), 31–56 (2014)

    Article  Google Scholar 

  8. Yechiali, U.: The Israeli queue with infinite number of groups. Prob. Eng. Inf. Sci. 28(1), 1–19 (2014)

    Article  Google Scholar 

  9. Kawasaki, N., Takagi, H., Takahashi, Y., Hong, S.-J., Hasegawa, T.: Waiting time analysis for M\(^{X}\)/G/1 priority queues with/without vacations under random order of service discipline. J. Appl. Math. Stoch. Anal. 13(4), 365–392 (2000)

    Article  Google Scholar 

  10. Borst, S.C., Boxma, O.J., Morrison, J.A., Nún̄ez-Queija, R.: The equivalent between processor sharing and service in random order. Oper. Res. Lett. 31(4), 254–262 (2003)

    Article  Google Scholar 

  11. Boxma, O.J., Foss, S.G., Lasgouttes, J.M., Queija, R.: Waiting time asymptotics in the single server queue with service in random order. Queueing Syst. 46(1–2), 35–73 (2004)

    Article  Google Scholar 

  12. Zeltyn, S., Feldman, Z., Wasserkrug, S.: Waiting and sojourn times in a multi-server queue with mixed priorities. Queueing Syst. 61(4), 305–328 (2009)

    Article  Google Scholar 

  13. Selen, J., Fralix, B.: Time-dependent analysis of an m/m/c preemptive priority system with two priority classes. Queueing Syst. 87(3–4), 379–415 (2017)

    Article  Google Scholar 

  14. Kella, O., Ravner, L.: Lowest priority waiting time distribution in an accumulating priority lévy queue. Oper. Res. Lett. 45(1), 40–45 (2017)

    Article  Google Scholar 

  15. Yu, M.: Analysis of complex stochastic system based on the phase-type process. In: Ph.D. Thesis (Sichuan Normal University, Sichuan, 2012)

  16. Chavoushi, A.A.: Analysis of an M/M/1 queue with customer interjection. Master’s Thesis (Dalhousie University, Halifax, 2010)

  17. He, Q.M., Chavoushi, A.A.: Analysis of queueing systems with customer interjections. Queueing Syst. 73(1), 79–104 (2013)

    Article  Google Scholar 

  18. Wu, W., He, G., Tang, Y., Yu, M.: An M/M/c queue with customer interjections and balking (in Chinese). Oper. Res. Trans. 22(4), 127–134 (2018)

    Google Scholar 

  19. Stewart, W.J.: Probability, Markov Chains, Queues, and Simulation: The Mathematical Basis of Performance Modelling. Princeton University Press, Princeton (2009)

    Book  Google Scholar 

Download references

Acknowledgements

The research was supported by the Funding of V.C. & V.R. Key Lab of Sichuan Province (SCVCVR2019.05VS), the National Natural Science Foundation of China (No.71571127) and the FSUSE (No. 2017RCL55).

Author information

Authors and Affiliations

  1. School of Science, Southwest University of Science and Technology, Mianyang, 621010, China

    Wenqing Wu & Yuanyuan Zhang

  2. V.C. & V.R. Key Lab of Sichuan Province, Sichuan Normal University, Chengdu, 610068, China

    Wenqing Wu & Yuanyuan Zhang

Authors
  1. Wenqing Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuanyuan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wenqing Wu.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wu, W., Zhang, Y. Analysis of a Markovian queue with customer interjections and finite buffer. OPSEARCH 57, 301–319 (2020). https://doi.org/10.1007/s12597-020-00437-w

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12597-020-00437-w

Keywords

Search

Navigation