Comparison of Policies for Routing Customers to Parallel Queueing Systems

DOI10.1287/OPRE.35.2.306zbMATH Open0623.90022OpenAlexW1964110375MaRDI QIDQ3762044FDOQ3762044

Authors: David J. jun. Houck 

Publication date: 1987

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.35.2.306

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

zbMATH Keywords

queueing systemupper boundshortest delay routing policytwo groups of servers

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Cited In (27)

• On the Shortest Queue Policy for the Tandem Parallel Queue
• The shorter queue polling model
• DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
• On the Assignment of Customers to Parallel Queues
• On the Optimality of the Generalized Shortest Queue Policy
• Mode I crack problem in an inhomogeneous orthotropic medium
• Optimal routing in two parallel queues with exponential service times
• Index Policies for the Admission Control and Routing of Impatient Customers to Heterogeneous Service Stations
• CHARACTERISTICS OF DETERMINISTIC OPTIMAL ROUTING FOR TWO HETEROGENEOUS PARALLEL SERVERS
• Asymptotically optimal component assembly plans in repairable systems and server allocation in parallel multiserver queues
• Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging
• Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approach
• Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues
• Allocation of flows in closed bipartite queueing networks
• A survey of Markov decision models for control of networks of queues
• Performance bounds for the effectiveness of pooling in multi-processing systems
• ON A ROUTING PROBLEM
• Optimal Routing in Closed Queueing Networks with State Dependent Queues
• Competitive queue policies for differentiated services
• Title not available (Why is that?)
• Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing
• Asymptotic optimality of the round-robin policy in multipath routing with resequencing
• Flexible Server Allocation and Customer Routing Policies for Two Parallel Queues When Service Rates Are Not Additive
• Customer routing to parallel servers with different rates
• Optimality of routing and servicing in dependent parallel processing systems
• The Effect of Idle Server First Random Routing on the Behavior of a Finite Queue
• Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling

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)