IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v100y2024i3d10.1007_s00186-024-00877-w.html

Whittle index approach to the multi-class queueing systems with convex holding costs and IHR service times

Author

Listed:
  • Samuli Aalto

    (Aalto University)

Abstract

We consider the dynamic scheduling problem in a single-server multi-class queueing system, where the accumulated holding costs of a customer is a convexly increasing function of the time that the customer spends in the system. This problem was already addressed by van Mieghem in his seminal paper (Ann Appl Probab 5:808–833, 1995). He launched the so-called generalized $$c\mu $$ c μ rule and proved its asymptotic optimality in the heavy traffic limit. The optimal scheduling problem with convex holding costs have also been studied in many other papers. However, the holding costs in these papers are typically count-convex, i.e., the aggregate holding cost rate related to a class of customers increases convexly as a function of the current number of customers in this class, which is clearly different from the time-convex holding costs introduced in van Mieghem (Ann Appl Probab 5:808–833, 1995) and studied also in the present paper. We utilize the Whittle index approach to develop a novel heuristic policy for the dynamic scheduling problem with time-convex holding costs. Instead of the original open version of the continuous-time scheduling problem, we apply the Whittle index approach to the corresponding discrete-time closed version of the problem. As the main theoretical contribution, we prove that, for IHR service times, the discounted discrete-time problem is indexable and also give an explicit expression for the Whittle index itself. A special challenge in our model is the two-dimensional state space with an infinite number of possible states. By utilizing the discrete-time results, we develop a novel index policy for the original continuous-time problem and demonstrate, by numerical simulations, that this Whittle index policy outperforms the generalized $$c\mu $$ c μ rule. Thus, while the generalized $$c\mu $$ c μ rule is asymptotically optimal in the heavy traffic limit, it can still be improved in normal traffic conditions.

Suggested Citation

  • Samuli Aalto, 2024. "Whittle index approach to the multi-class queueing systems with convex holding costs and IHR service times," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 100(3), pages 603-634, December.
  • Handle: RePEc:spr:mathme:v:100:y:2024:i:3:d:10.1007_s00186-024-00877-w
    DOI: 10.1007/s00186-024-00877-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00186-024-00877-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s00186-024-00877-w?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Zhenghua Long & Nahum Shimkin & Hailun Zhang & Jiheng Zhang, 2020. "Dynamic Scheduling of Multiclass Many-Server Queues with Abandonment: The Generalized cμ / h Rule," Operations Research, INFORMS, vol. 68(4), pages 1128-1230, July.
    2. Urtzi Ayesta & Manu K. Gupta & Ina Maria Verloop, 2021. "On the computation of Whittle’s index for Markovian restless bandits," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(1), pages 179-208, February.
    3. Nicolas Gast & Bruno Gaujal & Kimang Khun, 2023. "Testing indexability and computing Whittle and Gittins index in subcubic time," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 97(3), pages 391-436, June.
    4. P. S. Ansell & K. D. Glazebrook & J. Niño-Mora & M. O'Keeffe, 2003. "Whittle's index policy for a multi-class queueing system with convex holding costs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 57(1), pages 21-39, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Keerthana Gurushankar & Zhouzi Li & Mor Harchol-Balter & Alan Scheller-Wolf, 2026. "LookAhead: the optimal non-decreasing index policy for a time-varying holding cost problem," Queueing Systems: Theory and Applications, Springer, vol. 110(1), pages 1-35, March.
    2. Samuli Aalto, 2026. "Dynamic scheduling with convex delay costs revisited," Queueing Systems: Theory and Applications, Springer, vol. 110(1), pages 1-48, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Konstantin Avrachenkov & Vivek S. Borkar & Pratik Shah, 2026. "Lagrangian index policy for restless bandits with average reward," Queueing Systems: Theory and Applications, Springer, vol. 110(1), pages 1-34, March.
    2. Nicolas Gast & Bruno Gaujal & Kimang Khun, 2023. "Testing indexability and computing Whittle and Gittins index in subcubic time," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 97(3), pages 391-436, June.
    3. José Niño-Mora, 2006. "Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-Stock M/G/1 Queues," Mathematics of Operations Research, INFORMS, vol. 31(1), pages 50-84, February.
    4. Urtzi Ayesta & Manu K. Gupta & Ina Maria Verloop, 2021. "On the computation of Whittle’s index for Markovian restless bandits," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(1), pages 179-208, February.
    5. Samuli Aalto & Ziv Scully, 2023. "Minimizing the mean slowdown in the M/G/1 queue," Queueing Systems: Theory and Applications, Springer, vol. 104(3), pages 187-210, August.
    6. Ece Zeliha Demirci & Joachim Arts & Geert-Jan van Houtum, 2025. "A restless bandit approach for capacitated condition based maintenance scheduling," Flexible Services and Manufacturing Journal, Springer, vol. 37(1), pages 179-207, March.
    7. José Niño-Mora, 2020. "A Verification Theorem for Threshold-Indexability of Real-State Discounted Restless Bandits," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 465-496, May.
    8. Zhenghua Long & Hailun Zhang & Jiheng Zhang & Zhe George Zhang, 2024. "The Generalized c / μ Rule for Queues with Heterogeneous Server Pools," Operations Research, INFORMS, vol. 72(6), pages 2488-2506, November.
    9. Amit Sinha & Aditya Mahajan, 2025. "On the sensitivity of restless bandits solutions to uncertainty in the models of the arms," Annals of Operations Research, Springer, vol. 355(3), pages 2939-2969, December.
    10. Zhenghua Long & Tolga Tezcan & Jiheng Zhang, 2024. "Routing and Staffing in Customer Service Chat Systems with Generally Distributed Service and Patience Times," Manufacturing & Service Operations Management, INFORMS, vol. 26(5), pages 1674-1691, September.
    11. Jackie Baek & Justin J. Boutilier & Vivek F. Farias & Jónas Oddur Jónasson & Erez Yoeli, 2025. "Policy Optimization for Personalized Interventions in Behavioral Health," Manufacturing & Service Operations Management, INFORMS, vol. 27(3), pages 770-788, May.
    12. Cao, Ping & Zhong, Zhiheng, 2025. "Asymptotically optimal routing of a many-server parallel queueing system with long-run average criterion," European Journal of Operational Research, Elsevier, vol. 321(2), pages 462-475.
    13. Zhiheng Zhong & Ping Cao & Junfei Huang & Sean X. Zhou, 2024. "Capacity Allocation and Scheduling in Two-Stage Service Systems with Multiclass Customers," Manufacturing & Service Operations Management, INFORMS, vol. 26(5), pages 1842-1859, September.
    14. Keerthana Gurushankar & Zhouzi Li & Mor Harchol-Balter & Alan Scheller-Wolf, 2026. "LookAhead: the optimal non-decreasing index policy for a time-varying holding cost problem," Queueing Systems: Theory and Applications, Springer, vol. 110(1), pages 1-35, March.
    15. Lun Yu & Seyed Iravani & Ohad Perry, 2025. "Asymptotically Optimal Clearing Control of Backlogs in Multiclass Processing Systems," Operations Research, INFORMS, vol. 73(4), pages 2061-2078, July.
    16. S. Duran & U. Ayesta & I. M. Verloop, 2022. "On the Whittle index of Markov modulated restless bandits," Queueing Systems: Theory and Applications, Springer, vol. 102(3), pages 373-430, December.
    17. Noa Zychlinski, 2023. "Applications of fluid models in service operations management," Queueing Systems: Theory and Applications, Springer, vol. 103(1), pages 161-185, February.
    18. David B. Brown & Martin B. Haugh, 2017. "Information Relaxation Bounds for Infinite Horizon Markov Decision Processes," Operations Research, INFORMS, vol. 65(5), pages 1355-1379, October.
    19. L Ding & K D Glazebrook, 2005. "A static allocation model for the outsourcing of warranty repairs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(7), pages 825-835, July.
    20. T. W. Archibald & D. P. Black & K. D. Glazebrook, 2009. "Indexability and Index Heuristics for a Simple Class of Inventory Routing Problems," Operations Research, INFORMS, vol. 57(2), pages 314-326, April.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:mathme:v:100:y:2024:i:3:d:10.1007_s00186-024-00877-w. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.