Reducing Delay in Retrial Queues by Simultaneously Differentiating Service and Retrial Rates

Published Online:https://doi.org/10.1287/opre.2019.1933

References

  • Adusumilli KM, Hasenbein JJ (2010) Dynamic admission and service rate control of a queue. Queueing Systems 66(2):131–154.CrossrefGoogle Scholar
  • Aissani A, Phung-Duc T (2015) Optimal analysis for M/G/1 retrial queue with two-way communication. Gribaudo M, Manini D, Remke A, eds. Analytical and Stochastic Modelling Techniques and Applications ASMTA 2015, Lecture Notes in Computer Science, vol. 9081 (Springer, Cham, Switzerland), 1–14.Google Scholar
  • Anand KS, Pac MF, Veeraraghavan S (2011) Quality-speed conundrum: Trade-offs in customer-intensive services. Management Sci. 57(1):40–56.LinkGoogle Scholar
  • Artalejo JR (1997) Analysis of an M/G/1 queue with constant repeated attempts and server vacations. Comput. Oper. Res. 24(6):493–504.CrossrefGoogle Scholar
  • Artalejo JR, Falin JI (1994) Stochastic decomposition for retrial queues. TOP 2(2):329–342.CrossrefGoogle Scholar
  • Artalejo JR, Gómez-Corral A (2008) Retrial Queueing Systems: A Computational Approach (Springer, Berlin).CrossrefGoogle Scholar
  • Artalejo JR, Lopez-Herrero MJ (2007) On the distribution of the number of retrials. Appl. Math. Model. 31(3):478–489.CrossrefGoogle Scholar
  • Artalejo JR, Krishnamoorthy A, Lopez-Herrero MJ (2006) Numerical analysis of (s, s) inventory systems with repeated attempts. Ann. Oper. Res. 141(1):67–83.CrossrefGoogle Scholar
  • Ata B, Shneorson S (2006) Dynamic control of an M/M/1 service system with adjustable arrival and service rates. Management Sci. 52(11):1778–1791.LinkGoogle Scholar
  • Avrachenkov K, Morozov E, Nekrasova R (2015). Optimal and equilibrium retrial rates in single-server multi-orbit retrial systems. Jonsson M, Vinel A, Bellalta B, Tirkkonen O, eds. Multiple Access Communications, MACOM 2015, Lecture Notes in Computer Science, vol. 9305 (Springer, Cham, Switzerland), 135–146.Google Scholar
  • Choi BD, Shin YW, Ahn WC (1992) Retrial queues with collision arising from unslotted CSMA/CD protocol. Queueing Systems 11(4):335–356.CrossrefGoogle Scholar
  • Debo LG, Toktay LB, Van Wassenhove LN (2008) Queuing for expert services. Management Sci. 54(8):1497–1512.LinkGoogle Scholar
  • Ding S, Remerova M, van der Mei RD, Zwart B (2015) Fluid approximation of a call center model with redials and reconnects. Performance Evaluation 92(2):24–39.CrossrefGoogle Scholar
  • Elcan A (1994) Optimal customer return rate for an M/M/1 queueing system with retrials. Probab. Engrg. Inform. Sci. 8(4):521–539.CrossrefGoogle Scholar
  • Elcan A (1999) Asymptotic bounds for an optimal state-dependent retrial rate of the M/M/1 queue with returning customers. Math. Comput. Model. 30(3):129–140.CrossrefGoogle Scholar
  • Falin G, Templeton J (1997) Retrial Queues (CRC Press, Boca Raton, FL).CrossrefGoogle Scholar
  • Fayolle G, Gelenbe E, Labetoulle J (1977) Stability and optimal control of the packet switching broadcast channel. J. ACM 24(3):375–386.CrossrefGoogle Scholar
  • George JM, Harrison JM (2001) Dynamic control of a queue with adjustable service rate. Oper. Res. 49(5):720–731.LinkGoogle Scholar
  • Gharbi N, Dutheillet C, Ioualalen M (2009) Colored stochastic petri nets for modelling and analysis of multiclass retrial systems. Math. Comput. Model. 49(7–8):1436–1448.CrossrefGoogle Scholar
  • Guo P, Zipkin P (2007) Analysis and comparison of queues with different levels of delay information. Management Sci. 53(6):962–970.LinkGoogle Scholar
  • Harchol-Balter M (2013) Performance Modeling and Design of Computer Systems: Queueing Theory in Action (Cambridge University Press, New York).CrossrefGoogle Scholar
  • Hassin R, Haviv M (1996) On optimal and equilibrium retrial rates in a queueing system. Probab. Engrg. Inform. Sci. 10(2):223–228.CrossrefGoogle Scholar
  • Haviv M, Van Der Wal J (1997) Equilibrium strategies for processor sharing and random queues with relative priorities. Probab. Engrg. Inform. Sci. 11(4):403–412.CrossrefGoogle Scholar
  • Haviv M, Van Der Wal J (2007) Waiting times in queues with relative priorities. Oper. Res. Lett. 35(5):591–594.CrossrefGoogle Scholar
  • Hopp WJ, Iravani S, Yuen GY (2007) Operations systems with discretionary task completion. Management Sci. 53(1):61–77.LinkGoogle Scholar
  • Hyytiä E, Aalto S, Penttinen A (2012) Minimizing slowdown in heterogeneous size-aware dispatching systems. ACM SIGMETRICS Performance Evaluation Review, vol. 40 (ACM, London), 29–40.Google Scholar
  • Kella O, Yechiali U (1988) Priorities in M/G/1 queue with server vacations. Naval Res. Logist. 35(1):23–34.CrossrefGoogle Scholar
  • Li S, Ekici E, Shroff N (2015a) Throughput-optimal queue length based CSMA/CA algorithm for cognitive radio networks. IEEE Trans. Mobile Comput. 14(5):1098–1108.Google Scholar
  • Li S, Geng N, Xie X (2015b) Radiation queue: Meeting patient waiting time targets. IEEE Trans. Robotics Automation Magazine 22(2):51–63.CrossrefGoogle Scholar
  • Liang HM, Kulkarni VG (1999) Optimal routing control in retrial queues. Shanthikumar JG, Sumita U, eds. Applied Probability and Stochastic Processes, International Series in Operations Research & Management Science, vol. 19 (Springer, Boston), 203–218.Google Scholar
  • Liu Y, Whitt Y (2014) Stabilizing performance in networks of queues with time-varying arrival rates. Probab. Engrg. Inform. Sci. 28(4):419–449.CrossrefGoogle Scholar
  • Liu Y, Whitt Y (2017) Stabilizing performance in a service system with time-varying arrivals and customer feedback. Eur. J. Oper. Res. 256(2):473–486.CrossrefGoogle Scholar
  • Mandelbaum A, Stolyar AL (2004) Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ-rule. Oper. Res. 52(6):836–855.LinkGoogle Scholar
  • Mandelbaum A, Massey WA, Reiman M, Stolyar A (1999) Waiting time asymptotics for time varying multiserver queues with abandonment and retrials. Proc. of the Thirty-Seventh Annual Allerton Conf. on Comm., Control and Comput., Allerton, IL, 1095–1104.Google Scholar
  • Mandelbaum A, Massey WA, Reiman M, Rider B, Stolyar A (2002) Queue lengths and waiting times for multiserver queues with abandonment and retrials. Telecomm. Systems 21(2–4), 149–171.Google Scholar
  • Mendelson H, Whang S (1990) Optimal incentive-compatible priority pricing for the M/M/1 queue. Oper. Res. 38(5):870–883.LinkGoogle Scholar
  • Ren ZJ, Zhou Y-P (2008) Call center outsourcing: Coordinating staffing level and service quality. Management Sci. 54(2):369–383.LinkGoogle Scholar
  • Schrage LE, Miller LW (1966) The queue M/G/1 with the shortest remaining processing time discipline. Oper. Res. 14(4):670–684.LinkGoogle Scholar
  • Smith WE (1956) Various optimizers for single-stage production. Naval Res. Logist. Quart. 3(1–2):59–66.CrossrefGoogle Scholar
  • Tobagi FA, Hunt VB (1980) Performance analysis of carrier sense multiple access with collision detection. Comput. Networks 4(5):245–259.Google Scholar
  • Tran-Gia P, Mandjes M (1997) Modeling of customer retrial phenomenon in cellular mobile networks. IEEE Trans. Selected Areas Comm. 15(8):1406–1414.CrossrefGoogle Scholar
  • Wang J, Cao J, Li Q (2001) Reliability analysis of the retrial queue with server breakdowns and repairs. Queueing Systems 38(4):363–380.CrossrefGoogle Scholar
  • Wang J, Wang F, Li WW (2017) Strategic spectrum occupancy for secondary users in cognitive radio networks with retrials. Naval Res. Logist. 64(7):599–609.CrossrefGoogle Scholar
  • Xu Y, Scheller-Wolf A, Sycara K (2015) The benefit of introducing variability in single-server queues with application to quality-based service domains. Oper. Res. 63(1):233–246.LinkGoogle Scholar
  • Yom-Tov G, Mandelbaum A (2014) Erlang r: A time-varying queue with reentrant customers, in support of healthcare staffing. Manufacturing Service Oper. Management 16(2):283–299.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.