Parallel Scheduling of Multiclass M/M/m Queues: Approximate and Heavy-Traffic Optimization of Achievable Performance
From MaRDI portal
Publication:3635025
DOI10.1287/opre.49.4.609.11225zbMath1163.90422MaRDI QIDQ3635025
José Niño-Mora, Kevin D. Glazebrook
Publication date: 3 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.49.4.609.11225
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
90B36: Stochastic scheduling theory in operations research
Related Items
Four proofs of Gittins' multiarmed bandit theorem, Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation, Dynamic routing in large-scale service systems with heterogeneous servers, Assigning multiple job types to parallel specialized servers, Developing Effective Service Policies for Multiclass Queues with Abandonment: Asymptotic Optimality and Approximate Policy Improvement