On the Optimality of the Generalized Shortest Queue Policy
From MaRDI portal
Publication:3415986
DOI10.1017/S0269964800001777zbMath1134.90340MaRDI QIDQ3415986
Publication date: 19 January 2007
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (26)
Bad luck when joining the shortest queue ⋮ Dynamic routing to heterogeneous collections of unreliable servers ⋮ Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue ⋮ The shorter queue polling model ⋮ Asymptotics of insensitive load balancing and blocking phases ⋮ Shortest expected delay routing for Erlang servers ⋮ Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing ⋮ Optimal control of multiclass parallel service systems ⋮ Sample path methods in the control of queues ⋮ Understanding the marginal impact of customer flexibility ⋮ Towards minimum loss job routing to parallel heterogeneous multiserver queues via index policies ⋮ A 3-queue polling system with join the shortest-serve the longest policy ⋮ Asymptotically optimal component assembly plans in repairable systems and server allocation in parallel multiserver queues ⋮ Maximizing throughput in finite-source parallel queue systems ⋮ A conservative index heuristic for routing problems with multiple heterogeneous service facilities ⋮ Dynamic priority allocation via restless bandit marginal productivity indices ⋮ Optimality of routing and servicing in dependent parallel processing systems ⋮ Asymptotically optimal control of parallel tandem queues with loss ⋮ Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging ⋮ Analyzing \(E_k/E_r/ c\) queues ⋮ User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss ⋮ Multiple-server system with flexible arrivals ⋮ Optimizing Bernoulli routing policies for balancing loads on call centers and minimizing transmission costs ⋮ Partial Flexibility in Routeing and Scheduling ⋮ A polling system with `join the shortest -- serve the longest' policy ⋮ Signaling for decentralized routing in a queueing network
Cites Work
- Certain optimality properties of the first-come first-served discipline for G/G/s queues
- Weak convergence for generalized semi-Markov processes
- On the optimal assignment of servers and a repairman
- Continuity of Generalized Semi-Markov Processes
- A simple dynamic routing problem
- Optimality of the shortest line discipline
- On the optimal assignment of customers to parallel servers
This page was built for publication: On the Optimality of the Generalized Shortest Queue Policy
