Skip to main content
Log in

A queueing system with on-demand servers: local stability of fluid limits

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We study a system where a random flow of customers is served by servers (called agents) invited on-demand. Each invited agent arrives into the system after a random time; after each service completion, an agent returns to the system or leaves it with some fixed probabilities. Customers and/or agents may be impatient, that is, while waiting in queue, they leave the system at a certain rate (which may be zero). We consider the queue-length-based feedback scheme, which controls the number of pending agent invitations, depending on the customer and agent queue lengths and their changes. The basic objective is to minimize both customer and agent waiting times. We establish the system process fluid limits in the asymptotic regime where the customer arrival rate goes to infinity. We use the machinery of switched linear systems and common quadratic Lyapunov functions to approach the stability of fluid limits at the desired equilibrium point and derive a variety of sufficient local stability conditions. For our model, we conjecture that local stability is in fact sufficient for global stability of fluid limits; the validity of this conjecture is supported by numerical and simulation experiments. When local stability conditions do hold, simulations show good overall performance of the scheme.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Similar content being viewed by others

References

  1. Aksin, Z., Armony, M., Mehrotra, V.: The modern call center: a multi-disciplinary perspective on operations management research. Prod. Oper. Manag. 16(6), 665–688 (2007)

    Article  Google Scholar 

  2. American Telemedicine Association: Core Operational Guidelines for Telehealth Services Involving Provider-Patient Interactions (2014). http://www.americantelemed.org/docs/default-source/standards/core-operational-guidelines-for-telehealth-services.pdf?sfvrsn=6

  3. Bengtson, S.: Generating better results with crowdsourcing: leverage a network of high-quality professionals for customer service (2014). http://www.arise.com/

  4. Ethier, S.N., Kurtz, T.G.: Markov Processes: Characterization and Convergence. Wiley, London (1986)

    Book  Google Scholar 

  5. Formisano, P.: Flexibility for changing business needs: improve customer service and drive more revenue with a virtual crowdsourcing solution (2014). http://www.arise.com/

  6. Garnet, O., Mandelbaum, A., Reiman, M.: Designing a call center with impatient customers. Manuf. Serv. Oper. Manag. 4(3), 208–227 (2002). http://EconPapers.repec.org/RePEc:inm:ormsom:v:4:y:2002:i:3:p:208-227

  7. Gurvich, I., Ward, A.: On the dynamic control of matching queues. Stoch. Syst. 4(2), 479–523 (2014)

    Article  Google Scholar 

  8. Hespanha, J.P.: Uniform stability of switched linear systems: extensions of LaSalle’s invariance principle. IEEE Trans. Autom. Control 49(4), 470–482 (2004)

    Article  Google Scholar 

  9. Kashyap, B.R.K.: The double-ended queue with bulk service and limited waiting space. Oper. Res. 14(5), 822–834 (1966)

    Article  Google Scholar 

  10. Lin, H., Antsaklis, P.J.: Stability and stabilizability of switched linear systems: a survey of recent results. IEEE Trans. Autom. Control 54(2), 308–322 (2009)

    Article  Google Scholar 

  11. Liu, X., Gong, Q., Kulkarni, V.G. (2014) Diffusion models for doubly-ended queues with renewal arrival processes. Stoch. Syst. https://doi.org/10.1214/13-SSY113

  12. McGee-Smith, S.: Why companies are choosing to deploy the LiveOps cloud-based contact center (2010). http://www.liveops.com/sites/default/files/uploads/lo_wp_mcgee-smith_analytics.pdf

  13. Nguyen, L.M., Stolyar, A.L.: A service system with randomly behaving on-demand agents. SIGMETRICS Perform. Eval. Rev. 44(1), 365–366 (2016). https://doi.org/10.1145/2964791.2901484

    Article  Google Scholar 

  14. Pang, G., Stolyar, A.L.: A service system with on-demand agent invitations. Queueing Syst. Theory Appl. 82(3–4), 259–283 (2016). https://doi.org/10.1007/s11134-015-9464-8

    Article  Google Scholar 

  15. Pang, G., Talreja, R., Whitt, W.: Martingale proofs of many-server heavy-traffic limits for Markovian queues. Prob. Surv. 4, 193–267 (2007)

    Article  Google Scholar 

  16. Pontryagin, L.: Ordinary Differential Equations. Adiwes International Series in Mathematics. Addison-Wesley, Reading (1962). https://books.google.com/books?id=SQtKoAEACAAJ

  17. Rudin, W.: Principles of Mathematical Analysis. McGraw-Hill, New York (1976). http://opac.inria.fr/record=b1098274

  18. Shorten, R., Mason, O., O’Cairbre, F., Curran, P.: A unifying framework for the siso circle criterion and other quadratic stability criteria. Int. J. Control 77(1), 1–9 (2004)

    Article  Google Scholar 

  19. Shorten, R., Wirth, F., Mason, O., Wulff, K., King, C.: Stability criteria for switched and hybrid systems. SIAM Rev. 49(4), 545–592 (2007)

    Article  Google Scholar 

  20. Stolyar, A., Reiman, M., Korolev, N., Mezhibovsky, V., Ristock, H.: Pacing in knowledge worker engagement. United States Patent Application 20100266116-A1 (2010)

  21. Zeltyn, S., Mandelbaum, A.: Call centers with impatient customers: many-server asymptotics of the M/M/\(n\) + G queue. Queueing Syst. 51(3), 361–402 (2005). https://doi.org/10.1007/s11134-005-3699-8

    Article  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the referees for useful suggestions which helped to improve the exposition in the paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lam M. Nguyen.

Appendix: Some results for switched linear systems and CQLF

Appendix: Some results for switched linear systems and CQLF

The following facts are used in the proof of our main result (Theorem 2).

Proposition 1

([16]) Let \(L(\lambda ) = \det (A - \lambda I) = 0\) be the characteristic equation of a matrix A in \(\mathbb {R}^{3 \times 3}\):

$$\begin{aligned} L(\lambda ) = a_0 \lambda ^3 + a_1 \lambda ^2 + a_2 \lambda + a_3 = 0 \ , \ a_0 > 0. \end{aligned}$$
(66)

Matrix A is Hurwitz if and only if \(a_1\), \(a_2\), \(a_3\) are positive and \(a_1 a_2 > a_0 a_3\).

Proposition 2

([10, 19]) The existence of a CQLF for the LTI systems is sufficient for the exponential stability of the switched linear system.

Proposition 3

([10, 19]) Let \(A_1\) and \(A_2\) be Hurwitz matrices in \(\mathbb {R}^{n \times n}\), and the difference \(A_1 - A_2\) have rank one. Then, two systems \(u^\prime (t) = A_1 u(t)\) and \(u^\prime (t) = A_2 u(t)\) have a CQLF if and only if the matrix product \(A_1 A_2\) has no negative real eigenvalues.

Proposition 4

([18]) If \(A_1^{-1}\) is non-singular, the product \(A_1 A_2\) has no negative eigenvalues if and only if \(A_1^{-1} + \tau A_2\) is non-singular for all \(\tau \ge 0\).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Nguyen, L.M., Stolyar, A.L. A queueing system with on-demand servers: local stability of fluid limits. Queueing Syst 89, 243–268 (2018). https://doi.org/10.1007/s11134-017-9564-8

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-017-9564-8

Keywords

Mathematics Subject Classification