Skip to main content
Log in

Waiting time in the M/M/\( m \) LCFS nonpreemptive priority queue with impatient customers

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

As a model of a service center with multiple servers and prioritized impatient customers served in reverse order of arrival such as the 9-1-1 call center in the United States, we study an M/M/\( m \) nonpreemptive priority (last-come, first-served within the same class) queueing system with impatient customers in the steady state. We analyze the waiting time for those customers who are served successfully and the time to abandonment for those customers who leave the system while waiting. Explicit formulas are given for the probabilities of service and abandonment as well as the mean and second moment of the waiting time for customers of each class. Numerical examples are shown in order to demonstrate the computation of theoretical formulas. The difference in the behavior of the waiting time from that in the corresponding first-come, first-served system is discussed.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

References

  • Cobham, A. (1954). Priority assignment in waiting line problems. Operations Research, 2(1), 70–76.

    Google Scholar 

  • Cooper, R. B. (1972). Introduction to queueing theory. New York: The Macmillan Company.

    Google Scholar 

  • Cooper, R. B. (1981). Introduction to queueing theory (2nd ed.). Amsterdam: Elsevier North Holland.

    Google Scholar 

  • Davis, R. H. (1966). Waiting-time distribution of a multi-server, priority queuing system. Operations Research, 14(1), 133–136.

    Article  Google Scholar 

  • Gautam, N. (2012). Analysis of queues: Methods and applications. Boca Raton: CRC Press.

    Google Scholar 

  • Gnedenko, B. V., & Kovalenko, I. N. (1989). Introduction to queueing theory, second edition revised and supplemented. (Samuel Kotz, Trans.). Boston: Birkhäuser.

  • Iravani, F., & Balcıog̃lu, B. (2008). On priority queues with impatient customers. Queueing Systems, 58(4), 239–260.

    Article  Google Scholar 

  • Jagerman, D. L. (2000). Difference equations with applications to queues. New York: Marcel Dekker.

    Book  Google Scholar 

  • Jouini, O. (2012). Analysis of a last come first served queueing system with customer abandonment. Computers & Operations Research, 39, 3040–3045.

    Article  Google Scholar 

  • Jouini, O., & Roubos, A. (2014). On multiple priority multi-server queues with impatience. Journal of the Operational Research Society, 65(5), 616–632.

    Article  Google Scholar 

  • Kella, O., & Yechiali, U. (1985). Waiting times in the non-preemptive priority M/M/\( c \) queue. Stochastic Models, 1(2), 257–262.

    Article  Google Scholar 

  • Kulkarni, V. G. (1995). Modeling and analysis of stochastic systems. London: Chapman & Hall.

    Google Scholar 

  • Larson, R. C. (1987). Perspectives on queues: Social justice and the psychology of queuing. Operations Research, 35(6), 895–905.

    Article  Google Scholar 

  • Mandelbaum, A., & Zeltyn, S. (2007). Service engineering in action: The Palm/Erlang-A queue, with applications to call centers. In D. Spath & K.-P. Fähnrich (Eds.), Advances in services innovations (pp. 17–45). Berlin: Springer.

    Chapter  Google Scholar 

  • Riordan, J. (1962). Stochastic service systems. New York: Wiley.

    Google Scholar 

  • Subba Rao, S. (1967). Queuing with balking and reneging in M/G/1 systems. Metrika, 12(1), 173–188.

    Article  Google Scholar 

  • Takagi, H. (2014a). Waiting time in the M/M/\(m/(m+c)\) queue with impatient customers. International Journal of Pure and Applied Mathematics, 90(4), 519–559.

  • Takagi, H. (2014b). Waiting time in the M/M/\(m\) FCFS nonpreemptive priority queue with impatient customers. International Journal of Pure and Applied Mathematics, 97(3), 311–344.

  • Taylor, H. M., & Karlin, S. (1998). An introduction to stochastic modeling (3rd ed.). New York: Academic Press.

    Google Scholar 

  • Whitt, W. (2005). Engineering solution of a basic call-center model. Management Science, 51(2), 221–235.

    Article  Google Scholar 

  • Wolff, R. W. (1989). Stochastic modeling and the theory of queues. Upper Saddle River: Prentice Hall.

    Google Scholar 

  • Zeltyn, S., Feldman, Z., & Wasserkrug, S. (2009). Waiting and sojourn times in a multiple-server queue with mixed priorities. Queueing Systems, 61(4), 305–328.

    Article  Google Scholar 

Download references

Acknowledgments

I would like to thank the guest editors and anonymous reviewers for many valuable comments including the notification of references Jouini (2012), Jouini and Roubos (2014) in the reviewing process.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hideaki Takagi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Takagi, H. Waiting time in the M/M/\( m \) LCFS nonpreemptive priority queue with impatient customers. Ann Oper Res 247, 257–289 (2016). https://doi.org/10.1007/s10479-015-1876-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-015-1876-7

Keywords

Mathematics Subject Classification

Navigation