Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging

DOI10.1007/978-3-540-72709-5_15zbMath1181.68076MaRDI QIDQ3614975

José Niño-Mora

Publication date: 17 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72709-5_15

zbMATH Keywords

multi-server; admission control; parallel queues; dynamic routing; index policies; loss queues

Mathematics Subject Classification ID

90B22: Queues and service in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Dynamic priority allocation via restless bandit marginal productivity indices

Cites Work

• Unnamed Item
• Dynamic routing and admission control in high-volume service systems: Asymptotic analysis via multi-scale fluid limits
• Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue
• Optimality of the shortest line discipline with state-dependent service rates
• Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
• Restless bandits, partial conservation laws and indexability
• On the Optimality of the Generalized Shortest Queue Policy
• Comparison of Policies for Routing Customers to Parallel Queueing Systems
• Optimality of the shortest line discipline
• Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-Stock M/G/1 Queues