Optimality of the fastest available server policy

DOI10.1007/S11134-016-9502-1MaRDI QIDQ1691907zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Optimal and heuristic policies for dynamic server allocation
• Optimal adaptive server allocation in a network
• An optimal service policy for buffer systems
• scientific article; zbMATH DE number 1194425
• Optimal Service Speeds in a Competitive Environment
• Optimal policies for multi-server non-preemptive priority queues
• Optimal allocation of servers and processing time in a load balancing system
• The Optimal Look-Ahead Policy for Admission to a Single Server System
• Determining optimal parameters for expediting policies under service level constraints

Cites work

• scientific article; zbMATH DE number 1233798 (Why is no real title available?)
• scientific article; zbMATH DE number 1959508 (Why is no real title available?)
• scientific article; zbMATH DE number 2062343 (Why is no real title available?)
• scientific article; zbMATH DE number 826383 (Why is no real title available?)
• scientific article; zbMATH DE number 3082073 (Why is no real title available?)
• A Multiple Dispatch Queueing Model of Police Patrol Operations
• A note on the hypercube model
• Comparing ordered-entry queues with heterogeneous servers
• Contraction Mappings in the Theory Underlying Dynamic Programming
• Dynamic routing in large-scale service systems with heterogeneous servers
• Flexible Server Allocation and Customer Routing Policies for Two Parallel Queues When Service Rates Are Not Additive
• Heavy traffic resource pooling in parallel-server systems
• Heterogeneous-server loss systems with ordered entry: An anomaly
• On dynamic scheduling of a parallel server system with complete resource pooling
• On the incomplete results for the heterogeneous server problem
• On the optimal assignment of servers and a repairman
• Optimal control of a queueing system with two heterogeneous servers
• Queueing systems with synergistic servers
• Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
• Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes
• 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
• The Optimality of Full Service Policies
• Throughput maximization in a loss queueing system with heterogeneous servers

Cited in

(2)

• Instant Service Policy and Its Application to Deficit Round Robin
• Performance-based routing

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

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