Scheduling control for queueing systems with many servers: asymptotic optimality in heavy traffic
DOI10.1214/105051605000000601zbMath1098.60083arXivmath/0602526OpenAlexW3103538498MaRDI QIDQ2496503
Publication date: 10 July 2006
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0602526
Hamilton-Jacobi-Bellman equationasymptotically optimal controlsscheduling and routingMulticlass queueing systems
Central limit and other weak theorems (60F05) Dynamic programming in optimal control and differential games (49L20) 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)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Brownian models of open processing networks: Canonical representation of workload.
- A diffusion model of scheduling control in queueing systems with many servers
- Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Scheduling a multi class queue with many exponential servers: asymptotic optimality in heavy traffic.
- Heavy traffic resource pooling in parallel-server systems
- Heavy-Traffic Limits for Queues with Many Exponential Servers
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule