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

DOI10.1007/s00186-024-00877-wMaRDI QIDQ6659485

Samuli Aalto

Publication date: 9 January 2025

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

zbMATH Keywords

optimal schedulingmulti-class queueing systemsWhittle indexsingle-servergeneralized \(c\mu\) ruleconvex holding costs

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Asymptotically optimal priority policies for indexable and nonindexable restless bandits
• Asymptotically optimal index policies for an abandonment queue with convex holding cost
• Arm-acquiring bandits
• Whittle's index policy for a multi-class queueing system with convex holding costs
• Index heuristics for multiclass \(M/G/1\) systems with nonpreemptive service and convex holding costs
• Discrete hazard rate functions
• Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
• The single-server scheduling problem with convex costs
• On the Gittins index in the M/G/1 queue
• On the computation of Whittle's index for Markovian restless bandits
• Dynamic Scheduling of Multiclass Many-Server Queues with Abandonment: The Generalized cμ/h Rule
• On an index policy for restless bandits
• Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
• Testing indexability and computing Whittle and Gittins index in subcubic time

This page was built for publication: Whittle index approach to the multi-class queueing systems with convex holding costs and ihr service times