Skip to main content
Log in

Queues in tandem with customer deadlines and retrials

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We study queues in tandem with customer deadlines and retrials. We first consider a 2-queue Markovian system with blocking at the second queue, analyze it, and derive its stability condition. We then study a non-Markovian setting and derive the stability condition for an approximating diffusion, showing its similarity to the former condition. In the Markovian setting, we use probability generating functions and matrix analytic techniques. In the diffusion setting, we consider expectations of the first hitting times of compact sets.

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

Similar content being viewed by others

References

  1. Altman, E., Yechiali, U.: Analysis of customers impatience in queues with server vacations. Queueing Syst. 52(4), 261–279 (2006)

    Article  Google Scholar 

  2. Altman, E., Yechiali, U.: Infinite-server queues with system’s additional tasks and impatient customers. Probab. Eng. Inf. Sci. 22(4), 477–493 (2008)

    Google Scholar 

  3. Artalejo, J.: Accessible bibliography on retrial queues. Math. Comput. Model. 30(3–4), 223–233 (1999)

    Google Scholar 

  4. Asmussen, S.: Applied Probability and Queues, vol. 51. Springer, Berlin (2003)

    Google Scholar 

  5. Atar, R., Budhiraja, A., Dupuis, P.: On positive recurrence of constrained diffusion processes. Ann. Probab. 979–1000 (2001)

  6. Avrachenkov, K., Yechiali, U.: Retrial networks with finite buffers and their application to Internet data traffic. Probab. Eng. Inf. Sci. 22(4), 519–536 (2008)

    Article  Google Scholar 

  7. Avrachenkov, K., Yechiali, U.: On tandem blocking queues with a common retrial queue. Comput. Oper. Res. 37(7), 1174–1180 (2010)

    Article  Google Scholar 

  8. Billingsley, P.: Convergence of Probability Measures, 2nd edn. Wiley, New York (1999)

    Book  Google Scholar 

  9. Brandon, J., Yechiali, U.: A tandem Jackson network with feedback to the first node. Queueing Syst. 9(4), 337–352 (1991)

    Article  Google Scholar 

  10. Dai, J.: On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. Ann. Appl. Probab. 49–77 (1995)

  11. Falin, G., Templeton, J.: Retrial Queues, vol. 75. Chapman & Hall/CRC Press, London/Boca Raton (1997)

    Google Scholar 

  12. Garnett, O., Mandelbaum, A., Reiman, M.I.: Designing a call center with impatient customers. Manuf. Serv. Oper. Manag. 4, 208–227 (2002)

    Article  Google Scholar 

  13. Jackson, J.: Networks of waiting lines. Oper. Res. 5(4), 518–521 (1957)

    Article  Google Scholar 

  14. Jackson, J.: Jobshop-like queueing systems. Manag. Sci. 1796–1802 (2004)

  15. Karatzas, I., Shreve, S.: Brownian Motion and Stochastic Calculus. Springer, Berlin (1991)

    Google Scholar 

  16. Karatzas, I., Shreve, S.E.: Brownian Motion and Stochastic Calculus. Springer, New York (1991)

    Google Scholar 

  17. Lieb, E., Loss, M.: Analysis. Graduate Studies in Mathematics, vol. 14. American Mathematical Society, Providence, 4 (2001)

    Google Scholar 

  18. Litvak, N., Yechiali, U.: Routing in queues with delayed information. Queueing Syst. 43(1), 147–165 (2003)

    Article  Google Scholar 

  19. Mandelbaum, A., Momcilovic, P.: Queues with many servers and impatient customers. EECS Department, University of Michigan (2009)

  20. Mandelbaum, A., Zeltyn, S.: Staffing many-server queues with impatient customers: constraint satisfaction in call centers. Oper. Res. 57(5), 1189–1205 (2009)

    Article  Google Scholar 

  21. Meyn, S., Tweedie, R.: State-dependent criteria for convergence of Markov chains. Ann. Appl. Probab. 149–168 (1994)

  22. Neuts, M.: Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. Dover, New York (1981)

    Google Scholar 

  23. Perel, E., Yechiali, U.: Queues where customers of one queue act as servers of the other queue. Queueing Syst. 60(3), 271–288 (2008)

    Article  Google Scholar 

  24. Pitman, J., Yor, M.: Bessel processes and infinitely divisible laws. Stoch. Integr. 285–370 (1981)

  25. Reed, J.E., Ward, A.R.: A diffusion approximation for a generalized Jackson network with reneging. In: Proceedings of the 42nd Allerton Conference on Communication, Control, and Computing (2004)

    Google Scholar 

  26. Reed, J., Ward, A., Zhan, D.: On the generalized Skorokhod problem (submitted for publication)

  27. Ward, A., Glynn, P.: Properties of the reflected Ornstein–Uhlenbeck process. Queueing Syst. 44(2), 109–123 (2003)

    Article  Google Scholar 

  28. Whitt, W.: Stochastic-Process Limits. Springer, New York (2002)

    Google Scholar 

  29. Whitt, W.: Heavy-traffic limits for the G/H2/n/m/ queue. Math. Oper. Res. 30, 1–27 (2005)

    Article  Google Scholar 

  30. Yechiali, U.: Sequencing an n-stage process with feedback. Probab. Eng. Inf. Sci. 2(02), 263–265 (1988)

    Article  Google Scholar 

  31. Yechiali, U.: Queues with system disasters and impatient customers when system is down. Queueing Syst. 56(3), 195–202 (2007)

    Article  Google Scholar 

Download references

Acknowledgements

The authors would like to thank Jim Dai for bringing this problem to their attention. We thank Efrat Perel for providing the details of Theorem 5.1.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Josh Reed.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Reed, J., Yechiali, U. Queues in tandem with customer deadlines and retrials. Queueing Syst 73, 1–34 (2013). https://doi.org/10.1007/s11134-012-9290-1

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-012-9290-1

Keywords

Mathematics Subject Classification

Navigation