Pages that link to "Item:Q3635025"
From MaRDI portal
The following pages link to Parallel Scheduling of Multiclass <i>M/M/m</i> Queues: Approximate and Heavy-Traffic Optimization of Achievable Performance (Q3635025):
Displaying 9 items.
- Four proofs of Gittins' multiarmed bandit theorem (Q333080) (← links)
- Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation (Q490352) (← links)
- Optimal scheduling of parallel queues using stochastic flow models (Q763406) (← links)
- Dynamic routing in large-scale service systems with heterogeneous servers (Q812137) (← links)
- Scheduling multiclass queueing networks on parallel servers: approximate and heavy-traffic optimality of Klimov's priority rule (Q826091) (← links)
- Simultaneous determination of capacities and load in parallel \(M/M/1\) queues (Q1328598) (← links)
- Assigning multiple job types to parallel specialized servers (Q1628788) (← links)
- Developing Effective Service Policies for Multiclass Queues with Abandonment: Asymptotic Optimality and Approximate Policy Improvement (Q3186654) (← links)
- (Q4420518) (← links)
