Comparison of Policies for Routing Customers to Parallel Queueing Systems
From MaRDI portal
Recommendations
- Minimizing response times and queue lengths in systems of parallel queues
- On the Assignment of Customers to Parallel Queues
- Optimal routing of customers with general independent interarrival times in deterministic parallel queues
- Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues
- Optimal routing to parallel heterogeneous servers-small arrival rates
Cited in
(35)- Optimality of routing and servicing in dependent parallel processing systems
- Mode I crack problem in an inhomogeneous orthotropic medium
- Performance bounds for the effectiveness of pooling in multi-processing systems
- A pathwise comparison of parallel queues
- Steady-state analysis of shortest expected delay routing
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
- A survey of Markov decision models for control of networks of queues
- Dynamic routing in a distributed parallel many-server service system: the effect of \(\xi \)-choice
- Balanced routing with partial information in a distributed parallel many-server queueing system
- Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing
- Waiting time based routing policies to parallel queues with percentiles objectives
- Asymptotic optimality of the round-robin policy in multipath routing with resequencing
- Competitive queue policies for differentiated services
- Index Policies for the Admission Control and Routing of Impatient Customers to Heterogeneous Service Stations
- Allocation of flows in closed bipartite queueing networks
- The shorter queue polling model
- On the Optimality of the Generalized Shortest Queue Policy
- On the Shortest Queue Policy for the Tandem Parallel Queue
- On the Assignment of Customers to Parallel Queues
- Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging
- DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
- Customer routing to parallel servers with different rates
- The Effect of Idle Server First Random Routing on the Behavior of a Finite Queue
- Optimality of the round-robin routing policy
- Asymptotically optimal component assembly plans in repairable systems and server allocation in parallel multiserver queues
- Maximizing throughput in finite-source parallel queue systems
- Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approach
- scientific article; zbMATH DE number 1548171 (Why is no real title available?)
- ON A ROUTING PROBLEM
- Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues
- Delay-join the shortest queue routing for a parallel queueing system with removable servers
- Characteristics of deterministic optimal routing for two heterogeneous parallel servers
- Flexible Server Allocation and Customer Routing Policies for Two Parallel Queues When Service Rates Are Not Additive
- Optimal Routing in Closed Queueing Networks with State Dependent Queues
- Optimal routing in two parallel queues with exponential service times
This page was built for publication: Comparison of Policies for Routing Customers to Parallel Queueing Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3762044)
