Linear programming relaxations and marginal productivity index policies for the buffer sharing problem

DOI10.1007/S11134-008-9096-3zbMath1156.90328OpenAlexW1998526322MaRDI QIDQ1007148

Christian Nyberg, Jianhua Cao

Publication date: 27 March 2009

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

Full work available at URL: https://doi.org/10.1007/s11134-008-9096-3

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue
• Dynamic priority allocation via restless bandit marginal productivity indices
• Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
• Restless bandits, partial conservation laws and indexability
• A (2/3)n³ Fast-Pivoting Algorithm for the Gittins Index and Optimal Stopping of a Markov Chain
• Cones of Matrices and Set-Functions and 0–1 Optimization
• A Multi-User-Class, Blocked-Calls-Cleared, Demand Access Model
• Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic
• Sharing Memory Optimally
• Using TCP rate control for queue input-output rate matching
• Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-Stock M/G/1 Queues

This page was built for publication: Linear programming relaxations and marginal productivity index policies for the buffer sharing problem