Optimality of routing and servicing in dependent parallel processing systems
From MaRDI portal
The `` shortest queue problem for parallel service channels with different service rates deals with the question, when it is optimal for an arriving customer to join the shortest queue, or in general with finding optimal policies for joining parallel queues. Additionally in the paper it is assumed that there is some free service capacity which can for some time be given to one of the channels. The question is now, whether this should be given to the server with the longest queue. Under some structural assumptions these intuitive policies are shown to be optimal with respect to stochastic submajorization ordering.
Recommendations
- Minimizing response times and queue lengths in systems of parallel queues
- On the Assignment of Customers to Parallel Queues
- On the Optimality of the Generalized Shortest Queue Policy
- Optimal routing of customers with general independent interarrival times in deterministic parallel queues
- Joining the right queue: a state-dependent decision rule
Cites work
- A Priority Queue with Discounted Linear Costs
- A queueing model of a production system with two machines, one operator and priorities
- A Queueing Model to Analyze the Value of Centralized Inventory Information
- A two-queue, one-server model with priority for the longer queue
- Boundary value problems in queueing theory
- Comparison of Policies for Routing Customers to Parallel Queueing Systems
- Deciding Which Queue to Join: Some Counterexamples
- Dynamic Scheduling of a Multiclass Queue: Discount Optimality
- Dynamic Scheduling of a Two-Class Queue: Small Interest Rates
- Functions of Semi-Markov Processes
- scientific article; zbMATH DE number 3889341 (Why is no real title available?)
- scientific article; zbMATH DE number 3852171 (Why is no real title available?)
- scientific article; zbMATH DE number 3758067 (Why is no real title available?)
- scientific article; zbMATH DE number 3574704 (Why is no real title available?)
- J.comput. appl. math
- On the optimal assignment of customers to parallel servers
- On the Optimality of the Generalized Shortest Queue Policy
- Optimal Control of Single-Server Queuing Networks and Multi-Class M/G/1 Queues with Feedback
- Optimality of the shortest line discipline
- Stochastic Orderings for Markov Processes on Partially Ordered Spaces
- The autostrada queueing problem
- The shortest queue problem
- TWO QUEUES IN PARALLEL
- Two Similar Queues in Parallel
Cited in
(34)- Optimality of the shortest line discipline with state-dependent service rates
- Optimizing Bernoulli routing policies for balancing loads on call centers and minimizing transmission costs
- A pathwise comparison of parallel queues
- A survey of Markov decision models for control of networks of queues
- Optimal control of multiclass parallel service systems
- Sample path methods in the control of queues
- Throughput and delay optimality of power-of-\(d\) choices in inhomogeneous load balancing systems
- Signaling for decentralized routing in a queueing network
- A conservative index heuristic for routing problems with multiple heterogeneous service facilities
- A polling system with `join the shortest -- serve the longest' policy
- Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing
- Dynamic routing to heterogeneous collections of unreliable servers
- Optimal allocation of machines to distinguishable repairmen in order to maximize some reward functions
- Partial flexibility in routeing and scheduling
- Multiple-server system with flexible arrivals
- An overview for Markov decision processes in queues and networks
- The shorter queue polling model
- On the optimality of the shortest line discipline
- scientific article; zbMATH DE number 4204095 (Why is no real title available?)
- Asymptotic optimality of power-of-\(d\) load balancing in large-scale systems
- 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
- Optimizing Routing and Backlogs for Job Flows in a Distributed Computing Environment
- DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
- Individually optimal routing in parallel systems
- Understanding the marginal impact of customer flexibility
- Optimal routing to two parallel heterogeneous servers with resequencing
- ON A ROUTING PROBLEM
- On the Pathwise Optimal Bernoulli Routing Policy for Homogeneous Parallel Servers
- Self-Learning Threshold-Based Load Balancing
- Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
- Dynamic resource allocation in a multi-product make-to-stock production system
- Geometric lower bounds for the steady-state occupancy of processing networks with limited connectivity
This page was built for publication: Optimality of routing and servicing in dependent parallel processing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1177919)
