Improving Upon the Generalized cμ Rule: A Whittle Approach

References

• Aalto S (2024) Whittle index approach to the multi-class queueing systems with convex holding costs and IHR service times. Math. Methods Oper. Res. 100(3):603–634.Crossref, Google Scholar
• Aalto S (2026) Dynamic scheduling with convex delay costs revisited. Queueing Systems 110(1):2.Crossref, Google Scholar
• Anand A, de Veciana G (2018) A Whittle’s index based approach for QoE optimization in wireless networks. Proc. ACM Measurement Anal. Comput. Systems 2(1):1–39.Crossref, Google Scholar
• Ansell P, Glazebrook KD, Niño-Mora J, O’Keeffe M (2003) Whittle’s index policy for a multi-class queueing system with convex holding costs. Math. Methods Oper. Res. 57:21–39.Crossref, Google Scholar
• Atar R, Giat C, Shimkin N (2010) The cμ/θ rule for many-server queues with abandonment. Oper. Res. 58(5):1427–1439.Link, Google Scholar
• Atar R, Mandelbaum A, Reiman MI (2004) Scheduling a multi class queue with many exponential servers: Asymptotic optimality in heavy traffic. Ann. Appl. Probab. 14(3):1084–1134.Crossref, Google Scholar
• Bispo CF (2013) The single-server scheduling problem with convex costs. Queueing Systems 73:261–294.Crossref, Google Scholar
• Boyce WE, Diprima RC, Meade DB (2017) Elementary Differential Equations and Boundary Value Problems (John Wiley & Sons, Hoboken, NJ).Google Scholar
• Buyukkoc C, Varaiya P, Walrand J (1985) The c-mu rule revisited. Adv. Appl. Probab. 17(1):237–238.Crossref, Google Scholar
• Cox DR (2020) Queues (Chapman and Hall/CRC, Boca Raton, FL).Crossref, Google Scholar
• Fajardo VA, Drekic S (2017) Waiting time distributions in the preemptive accumulating priority queue. Methodology Comput. Appl. Probab. 19:255–284.Crossref, Google Scholar
• Gittins JC (1979) Bandit processes and dynamic allocation indices. J. Roy. Statist. Soc. Ser. B Statist. Methodology 41(2):148–164.Crossref, Google Scholar
• Glazebrook KD, Lumley R, Ansell P (2003) Index heuristics for multiclass M/G/1 systems with nonpreemptive service and convex holding costs. Queueing Systems 45:81–111.Crossref, Google Scholar
• Gurvich I, Whitt W (2009) Scheduling flexible servers with convex delay costs in many-server service systems. Manufacturing Service Oper. Management 11(2):237–253.Link, Google Scholar
• Harchol-Balter M (2013) Performance Modeling and Design of Computer Systems: Queueing Theory in Action (Cambridge University Press, Cambridge).Crossref, Google Scholar
• Larrañaga M, Ayesta U, Verloop IM (2014) Index policies for a multi-class queue with convex holding cost and abandonments. Sanghavi S, Shakkottai S, Lelarge M, Schroeder B, eds. ACM Internat. Conf. Measurement Model. Comput. Systems (ACM, New York), 125–137.Google Scholar
• Larrañaga M, Ayesta U, Verloop IM (2016) Dynamic control of birth-and-death restless bandits: Application to resource-allocation problems. IEEE/ACM Trans. Networking 24(6):3812–3825.Crossref, Google Scholar
• Long Z, Shimkin N, Zhang H, Zhang J (2020) Dynamic scheduling of multiclass many-server queues with abandonment: The generalized cμ/h rule. Oper. Res. 68(4):1218–1230.Link, Google 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.Link, Google Scholar
• Niño-Mora J (2007) Dynamic priority allocation via restless bandit marginal productivity indices. Trans. Oper. Res. 15:161–198.Google Scholar
• Puterman ML (2014) Markov Decision Processes: Discrete Stochastic Dynamic Programming (John Wiley & Sons, Hoboken, NJ).Google Scholar
• Scully Z, Harchol-Balter M (2021) The Gittins policy in the M/G/1 queue. Ghaderi J, Uysal E, Xue G, eds. 19th Internat. Sympos. Model. Optim. Mobile Ad Hoc Wireless Networks (IEEE, Piscataway, NJ), 248–255.Google Scholar
• Stanford DA, Taylor P, Ziedins I (2014) Waiting time distributions in the accumulating priority queue. Queueing Systems 77:297–330.Crossref, Google Scholar
• Van Mieghem JA (1995) Dynamic scheduling with convex delay costs: The generalized c-mu rule. Ann. Appl. Probab. 5(3):809–833.Google Scholar
• Whittle P (1988) Restless bandits: Activity allocation in a changing world. J. Appl. Probab. 25(A):287–298.Crossref, Google Scholar
• Whittle P (2005) Tax problems in the undiscounted case. J. Appl. Probab. 42(3):754–765.Crossref, Google Scholar