Optimal Dynamic Assignment of Customers to Heterogeneous Servers in Parallel

DOI10.1287/OPRE.40.6.1126MaRDI QIDQ4032590zbMATH OpenOpenAlexFDO

Authors Susan H. Xu, Rhonda Righter, J. George Shanthikumar

Publication date 1 April 1993

Published in Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

parallel serverstwo classes of customers

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Recommendations

• An assignment problem for a parallel queueing system with two heterogeneous servers
• Optimal Routing of Customers to Two Parallel Heterogeneous Servers: The Case of IHR Service Times
• On the Assignment of Customers to Parallel Queues
• On the static assignment to parallel servers
• Customer routing to different servers with complete information

Cited in

(20)

• Optimal control of a stochastic assembly production line
• On computing average cost optimal policies with application to routing to parallel queues
• An assignment problem for a parallel queueing system with two heterogeneous servers
• Allocating flexible servers in serial systems with switching costs
• Dynamic server assignment policies for assembly-type queues with flexible servers
• An overview for Markov decision processes in queues and networks
• Optimal Dynamic Server Allocation in Systems with On/Off Sources
• Multi-Agent Customer Allocation in a Stochastic Service System
• A heuristic rule for routing customers to parallel servers
• Analysis of job assignment with batch arrivals among heterogeneous servers
• Maximizing throughput in finite-source parallel queue systems
• On the static assignment to parallel servers
• Optimal server assignment for a multiple customer classes problem
• scientific article; zbMATH DE number 1409906 (Why is no real title available?)
• Infinite-horizon average optimality of the N-network in the Halfin-Whitt regime
• scientific article; zbMATH DE number 6452758 (Why is no real title available?)
• Computational Science and Its Applications – ICCSA 2004
• A Dynamic Programming Model For Assigning Customers To Priority Service Classes
• Matched queues with flexible and impatient customers
• Filtering policies in loss queueing network location problems

This page was built for publication: Optimal Dynamic Assignment of Customers to Heterogeneous Servers in Parallel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4032590)