Performance-based routing
From MaRDI portal
Publication:1785272
DOI10.1016/j.orl.2014.07.003zbMath1408.90085MaRDI QIDQ1785272
Petar Momčilović, Avishai Mandelbaum
Publication date: 28 September 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2014.07.003
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
Cites Work
- Unnamed Item
- Unnamed Item
- The M/M/\(\infty\) service system with ranked servers in heavy traffic. With a preface by Franz Ferschl
- Dynamic routing in large-scale service systems with heterogeneous servers
- Central limit theorem for a many-server queue with random service rates
- Comparing ordered-entry queues 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