Dynamized routing policies for minimizing expected waiting time in a multi-class multi-server system
From MaRDI portal
Publication:2669641
Recommendations
- Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues
- Routing Jobs to Servers with Deterministic Service Times
- Dynamic routing in a distributed parallel many-server service system: the effect of \(\xi \)-choice
- DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
- Dynamic Routing in a Queueing System with a Multiple Service Facility
Cites work
- scientific article; zbMATH DE number 3732950 (Why is no real title available?)
- A note on the convexity of performance measures of M/M/c queueing systems
- Approximations for the M/G/m Queue
- Dynamic control of \(N\)-systems with many servers: asymptotic optimality of a static priority policy in heavy traffic
- Dynamic routing in large-scale service systems with heterogeneous servers
- Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems
- Handbooks in operations Research \& management science: Transportation
- Optimal control of parallel server systems with many servers in heavy traffic
- Optimization of static traffic allocation policies
- Routing and staffing when servers are strategic
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- Simultaneous location of trauma centers and helicopters for emergency medical service planning
- The convexity of the mean queue size of the M/M/c queue with respect to the traffic intensity
Cited in
(2)
This page was built for publication: Dynamized routing policies for minimizing expected waiting time in a multi-class multi-server system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669641)