Performance-based routing
From MaRDI portal
Recommendations
- Routing and scheduling in heterogeneous systems: a sample path approach
- Dynamic routing in large-scale service systems with heterogeneous servers
- Optimality of the fastest available server policy
- Dynamic routing in a distributed parallel many-server service system: the effect of \(\xi \)-choice
- On the incomplete results for the heterogeneous server problem
Cites work
- scientific article; zbMATH DE number 3574935 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- Central limit theorem for a many-server queue with random service rates
- Comparing ordered-entry queues with heterogeneous servers
- Dynamic routing in large-scale service systems with heterogeneous servers
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
- Efficient routing in heavy traffic under partial sampling of service times
- Heavy-Traffic Limits for Queues with Many Exponential Servers
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- The M/M/\(\infty\) service system with ranked servers in heavy traffic. With a preface by Franz Ferschl
Cited in
(1)
This page was built for publication: Performance-based routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785272)