Skip to main content
Log in

The “Sensitive” Markovian queueing system and its application for a call center problem

  • S.I.: Feinberg: Probability
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In this paper, we study the \(M_n/M_n/c/K+M_n\) queueing system where customers arrive according to a Poisson process with state-dependent rates. Moreover, the rates of the exponential service times and times to abandonment of the queued customers can also change whenever the system size changes. This implies that a customer may experience different service rates throughout the time she is being served. Similarly, a queued customer can change her patience time limits while waiting in the queue. Thus, we refer to the analyzed system as the “sensitive” Markovian queue. We conduct an exact analysis of this system and obtain its steady-state performance measures. The steady-state system size distribution yields itself via a birth–death process. The times spent in the queue by an arbitrary or an eventually served customer are represented as the times until absorption in two continuous-time Markov chains and follow Phase-type distributions with which the queueing time distributions and moments are obtained. Then, we demonstrate how the \(M_n/M_n/c/K+M_n\) queue can be employed to approximately yet accurately estimate the performance measures of the \(M_n/GI/c/K+GI\) type call center.

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.

Similar content being viewed by others

References

  • Abate, J., & Valkó, P. P. (2014). Multi-precision Laplace transform inversion. International Journal for Numerical Methods in Engineering, 60(5), 979–993.

    Article  Google Scholar 

  • Akşin, Z., Ata, B., Emadi, S. M., & Su, C. (2016). Impact of delay announcements in call centers: An empirical approach. Operations Research,. https://doi.org/10.1287/opre.2016.1542.

    Article  Google Scholar 

  • Altıok, T. (1997). Performance analysis of manufacturing systems. New York, NY: Springer.

    Book  Google Scholar 

  • Armony, M., Plambeck, E., & Seshardi, S. (2009a). Sensitivity of optimal capacity to customer impatience in an unobservable M/M/S queue (Why you shouldn’t shout at the DMV). Manufacturing & Service Operations Management, 11(1), 19–32.

    Article  Google Scholar 

  • Armony, M., Shimkin, N., & Whitt, W. (2009b). The impact of delay announcements in many-server queues with abandonment. Operations Research, 57(1), 66–81.

    Article  Google Scholar 

  • Ata, B., & Shneorson, S. (2006). Dynamic control of an M/M/1 service system with adjustable arrival and service rates. Management Science, 52(11), 1778–1791.

    Article  Google Scholar 

  • Baccelli, F., & Hebuterne, G. (1981). On queues with impatient customers. In Kylstra, F.J. (Ed.), Performance ’81 (Vol. 32, pp. 159–179), North Holland, Amsterdam.

  • Batt, R. J., & Terwiesch, C. (2016). Early task initiation and other load-adaptive mechanisms in the emergency department. Operations Research,. https://doi.org/10.1287/mnsc.2016.2516.

    Article  Google Scholar 

  • Berry Jaeker, J. A., & Tucker, A. L. (2016). Past the point of speeding up: The negative effects of workload saturation on efficiency and patient severity. Management Science,. https://doi.org/10.1287/mnsc.2015.2387.

    Article  Google Scholar 

  • Brandt, A., & Brandt, M. (1999). On the \(M(n)/M(m)/s\) queues with impatient calls. Performance Evaluation, 35(1–2), 1–18.

    Article  Google Scholar 

  • Brandt, A., & Brandt, M. (2002). Asymptotic results and a Markovian approximation for the \(M(n)/M(m)/S+GI\) system. Queueing Systems: Theory and Applications, 41, 73–94.

    Article  Google Scholar 

  • Elmaghraby, W., & Keskinocak, P. (2003). Dynamic pricing in the presence of inventory considerations: Research overview, current practices, and future directions. Management Science, 49(10), 12871309.

    Article  Google Scholar 

  • Iravani, F., & Balcıog̃lu, B. (2008). Approximations for the \(M/GI/N +GI\) type call center. Queueing Systems, 58, 137–153.

    Article  Google Scholar 

  • Jouini, O., Akşin, O. Z., Karaesmen, F., Aguir, M. S., & Dallery, Y. (2015). Call center delay announcement using a newsvendor-like performance criterion. Production and Operations Management, 24(4), 587–604.

    Article  Google Scholar 

  • Jouini, O., Akşin, Z., & Dallery, Y. (2011). Call centers with delay information: Models and insights. Manufacturing & Service Operations Management, 13(4), 534–548.

    Article  Google Scholar 

  • Katehakis, M. N., & Derman, C. (1989). On the maintenance of systems composed of highly reliable components. Management Science, 35(5), 1628.

    Article  Google Scholar 

  • Katehakis, M. N., & Melolidakis, C. (1995). On the optimal maintenance of systems and control of arrivals in queues. Stochastic Analysis and Applications, 13(2), 137–164.

    Article  Google Scholar 

  • Katehakis, M. N., & Smit, L. C. (2012). Efficient algorithms for computing an optimal (R, Q) policy in continuous review stochastic inventory systems with quantity discounts. Annals of Operations Research, 200(1), 279–298.

    Article  Google Scholar 

  • Movaghar, A. (1998). On queueing with customer impatience until the beginning of service. Queueing Systems, 29, 337–350.

    Article  Google Scholar 

  • Naor, P. (1969). The regulation of queue size by levying tolls. Econometrica, 37(1), 1524.

    Article  Google Scholar 

  • Tan, T. F., & Netessine, S. (2014). When does the devil make work? An empirical study of the impact of workload on worker productivity. Management Science, 60(6), 15741593.

    Article  Google Scholar 

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

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported in part by TÜBİTAK, The Scientific and Technological Research Council of Turkey, under the Grant No. 213M428. The authors thank the two anonymous referees and the editors for their invaluable suggestions to improve the manuscript.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Odysseas Kanavetas.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kanavetas, O., Balcıog̃lu, B. The “Sensitive” Markovian queueing system and its application for a call center problem. Ann Oper Res 317, 651–664 (2022). https://doi.org/10.1007/s10479-018-2802-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-018-2802-6

Keywords

Navigation