Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue

DOI10.1007/s11134-006-0302-xzbMath1117.90035OpenAlexW3013005026MaRDI QIDQ855181

José Niño-Mora

Publication date: 4 January 2007

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10016/226

zbMATH Keywords

Conservation lawsSchedulingBias optimalityDelay-sensitiveFinite buffersIndex policiesLoss-sensitiveMulti-queue switchMulticlass queueRestless banditsWork-cost analysis

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items

Whittle’s Index Policy for Multi-Target Tracking with Jamming and Nondetections ⋮ Towards minimum loss job routing to parallel heterogeneous multiserver queues via index policies ⋮ Dynamic priority allocation via restless bandit marginal productivity indices ⋮ Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging ⋮ A Marginal Productivity Index Rule for Scheduling Multiclass Queues with Setups ⋮ Linear programming relaxations and marginal productivity index policies for the buffer sharing problem ⋮ Learning Unknown Service Rates in Queues: A Multiarmed Bandit Approach

Cites Work

• Beyond the \(c\mu\) rule: Dynamic scheduling of a two-class loss queue
• Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
• Finite state multi-armed bandit problems: Sensitive-discount, average-reward and average-overtaking optimality
• Restless bandits, partial conservation laws and indexability
• Modeling and dynamic scheduling of a queueing system with blocking and starvation
• On the duality between routing and scheduling systems with finite buffer space
• On the Optimality of the Generalized Shortest Queue Policy
• Bias Optimality in Controlled Queueing Systems
• Discrete Dynamic Programming
• Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-Stock M/G/1 Queues
• Optimal Server Allocation to Parallel Queues with Finite-Capacity Buffers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue