On the Optimality of the Generalized Shortest Queue Policy
From MaRDI portal
Recommendations
Cites work
- A simple dynamic routing problem
- Certain optimality properties of the first-come first-served discipline for G/G/s queues
- Continuity of Generalized Semi-Markov Processes
- On the optimal assignment of customers to parallel servers
- On the optimal assignment of servers and a repairman
- Optimality of the shortest line discipline
- Weak convergence for generalized semi-Markov processes
Cited in
(36)- Optimality of the shortest line discipline with state-dependent service rates
- Optimality of routing and servicing in dependent parallel processing systems
- On the average optimality of circular assignment policy
- Analyzing \(E_k/E_r/ c\) queues
- Optimizing Bernoulli routing policies for balancing loads on call centers and minimizing transmission costs
- Shortest expected delay routing for Erlang servers
- Optimal timer-based caching policies for general arrival processes
- Asymptotics of insensitive load balancing and blocking phases
- A pathwise comparison of parallel queues
- Optimal control of multiclass parallel service systems
- Sample path methods in the control of queues
- Towards minimum loss job routing to parallel heterogeneous multiserver queues via index policies
- Signaling for decentralized routing in a queueing network
- A conservative index heuristic for routing problems with multiple heterogeneous service facilities
- A polling system with `join the shortest -- serve the longest' policy
- Bad luck when joining the shortest queue
- Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing
- Dynamic routing to heterogeneous collections of unreliable servers
- Partial flexibility in routeing and scheduling
- Multiple-server system with flexible arrivals
- The shorter queue polling model
- On the optimality of the shortest line discipline
- On the Shortest Queue Policy for the Tandem Parallel Queue
- Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging
- Understanding the marginal impact of customer flexibility
- An approximation for the mean response time for shortest queue routing with general interarrival and service times
- Asymptotically optimal component assembly plans in repairable systems and server allocation in parallel multiserver queues
- Maximizing throughput in finite-source parallel queue systems
- scientific article; zbMATH DE number 1936537 (Why is no real title available?)
- Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates
- User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss
- Asymptotically optimal control of parallel tandem queues with loss
- A 3-queue polling system with join the shortest-serve the longest policy
- The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times
- Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue
- Dynamic priority allocation via restless bandit marginal productivity indices
This page was built for publication: On the Optimality of the Generalized Shortest Queue Policy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3415986)
