Optimal Server Allocation to Parallel Queues with Finite-Capacity Buffers

DOI10.1017/S0269964800004332zbMath1093.90513OpenAlexW2167511084MaRDI QIDQ5485370

Kimberly Wasserman, Nicholas Bambos

Publication date: 30 August 2006

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964800004332

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items

Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue, Dynamic priority allocation via restless bandit marginal productivity indices

Cites Work

• Unnamed Item
• Head of the line processor sharing for many symmetric queues with finite capacity
• Stochastic partial ordering
• On the duality between routing and scheduling systems with finite buffer space
• A new ordering for stochastic majorization: theory and applications
• Sample Path Criteria for Weak Majorization
• Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates