Blind fair routing in large-scale service systems with heterogeneous customers and servers
From MaRDI portal
(Redirected from Publication:5301124)
Recommendations
- Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems
- Dynamic routing in large-scale service systems with heterogeneous servers
- Service-level differentiation in many-server service systems via queue-ratio routing
- A blind policy for equalizing cumulative idleness
- Routing and staffing in large-scale service systems: the case of homogeneous impatient customers and heterogeneous servers
Cited in
(23)- Many-server scaling of the N-system under FCFS-ALIS
- An ergodic control problem for many-server multiclass queueing systems with cross-trained servers
- Infinite horizon asymptotic average optimality for large-scale parallel server networks
- Design heuristic for parallel many server systems
- Increases or discounts: price strategies based on customers' patience times
- Asymptotically optimal idling in the \(GI/GI/N+GI\) queue
- A survey on skill-based routing with applications to service operations management
- Routing and staffing when servers are strategic
- Partial flexibility in routeing and scheduling
- Maximum weight matching with hysteresis in overloaded queues with setups
- Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems
- Inequity averse optimization in operational research
- On patient flow in hospitals: a data-based queueing-science perspective
- On the optimal design of a bipartite matching queueing system
- A fluid model for one-sided bipartite matching queues with match-dependent rewards
- Optimal admission and routing with congestion-sensitive customer classes
- Fluid models of parallel service systems under FCFS
- Information and memory in dynamic resource allocation
- Tightness of invariant distributions of a large-scale flexible service system under a priority discipline
- Infinite-horizon average optimality of the N-network in the Halfin-Whitt regime
- Diffusion-scale tightness of invariant distributions of a large-scale flexible service system
- A blind policy for equalizing cumulative idleness
- Asymptotically optimal routing of a many-server parallel queueing system with long-run average criterion
This page was built for publication: Blind fair routing in large-scale service systems with heterogeneous customers and servers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301124)
