Optimality of the fastest available server policy

DOI10.1007/s11134-016-9502-1zbMath1386.60312OpenAlexW3123133927MaRDI QIDQ1691907

Matthew J. Sobel, Charu Sinha, William P. Millhiser

Publication date: 25 January 2018

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://digitalcommons.chapman.edu/business_articles/55

zbMATH Keywords

heterogeneous serversMarkovian queuefastest available servermatching arrivals with serversqueueing cost minimization

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the hypercube model
• Dynamic routing in large-scale service systems with heterogeneous servers
• Comparing ordered-entry queues with heterogeneous servers
• Heterogeneous-server loss systems with ordered entry: An anomaly
• Heavy traffic resource pooling in parallel-server systems
• On the incomplete results for the heterogeneous server problem
• Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes
• TECHNICAL NOTE—Queueing Systems with Synergistic Servers
• Throughput maximization in a loss queueing system with heterogeneous servers
• Optimal control of a queueing system with two heterogeneous servers
• A Multiple Dispatch Queueing Model of Police Patrol Operations
• On the optimal assignment of servers and a repairman
• The Optimality of Full Service Policies
• Technical Note—Optimal Service Policies, Just after Idle Periods, in Two-Server Heterogeneous Queuing Systems
• The Lagged PSA for Estimating Peak Congestion in Multiserver Markovian Queues with Periodic Arrival Rates
• Flexible Server Allocation and Customer Routing Policies for Two Parallel Queues When Service Rates Are Not Additive
• Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
• Contraction Mappings in the Theory Underlying Dynamic Programming

This page was built for publication: Optimality of the fastest available server policy