Optimality of the shortest line discipline

Cited in

(92)

A general ``power-of-\(d\) dispatching framework for heterogeneous systems
Signaling for decentralized routing in a queueing network
Queue-length-aware dispatching in large-scale heterogeneous systems
Throughput and delay optimality of power-of-\(d\) choices in inhomogeneous load balancing systems
Performance balancing size-interval routing policies
Transform methods for heavy-traffic analysis
Distributed dispatching in the parallel server model
Task allocation in multiserver systems -- a survey of results.
Mean-field fluctuations at diffusion scale in threshold-based randomized routing for processor sharing systems and applications
Self-Learning Threshold-Based Load Balancing
Power-of-d-Choices with Memory: Fluid Limit and Optimality
Persistent-idle load-distribution
Delay-join the shortest queue routing for a parallel queueing system with removable servers
Optimal admission and routing with congestion-sensitive customer classes
A fair policy for the \(\mathrm{G}/\mathrm{GI}/N\) queue with multiple server pools
Partial flexibility in routeing and scheduling
The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times
On the value function of the M/G/1 FCFS and LCFS queues
A polling system with `join the shortest -- serve the longest' policy
A lower bound on the queueing delay in resource constrained load balancing
Open problem: Load balancing using delayed information
Choosing among heterogeneous server clouds
Martingales and buffer overflow for the symmetric shortest queue model
Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
A load balancing system in the many-server heavy-traffic asymptotics
Zero-wait load balancing with sparse messaging
Resource allocation and routing in parallel multi-server queues with abandonments for cloud profit maximization
Stability of parallel server systems
Stochastically minimizing the number of customers in exponential queueing systems
Job assignment in large-scale service systems with affinity relations
Control of arrivals to two queues in series
Dynamic priority allocation via restless bandit marginal productivity indices
Endogenous queue number determination in \(G/m/s\) systems
Steady-state analysis of load-balancing algorithms in the sub-Halfin-Whitt regime
Balancing queues by mean field interaction
Routing jobs with deadlines to heterogeneous parallel servers
Joint routing and scheduling control in a two-class network with a flexible server
Characteristics of deterministic optimal routing for two heterogeneous parallel servers
Multiple-server system with flexible arrivals
Monotonicity properties of user equilibrium policies for parallel batch systems
Bad luck when joining the shortest queue
Sample path methods in the control of queues
To pool or not to pool: queueing design for large-scale service systems
A survey of Markov decision models for control of networks of queues
Stationary analysis of the shortest queue problem
Optimal control of multiclass parallel service systems
Approximating the mean response time of parallel queues with JSQ policy
On the average optimality of circular assignment policy
Waiting time based routing policies to parallel queues with percentiles objectives
A conservative index heuristic for routing problems with multiple heterogeneous service facilities
Dynamic routing in a distributed parallel many-server service system: the effect of \(\xi \)-choice
Optimality of the shortest line discipline with state-dependent service rates
Understanding the marginal impact of customer flexibility
Stochastic relations of random variables and processes
Practical load balancing for content requests in peer-to-peer networks
On computing average cost optimal policies with application to routing to parallel queues
On the Optimality of the Generalized Shortest Queue Policy
Dynamic Scheduling of a Four-Station Queueing Network
On the Assignment of Customers to Parallel Queues
Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
Insensitive versus efficient dynamic load balancing in networks without blocking
Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging
Asymptotically optimal control of parallel tandem queues with loss
Optimality of routing and servicing in dependent parallel processing systems
Universality of power-of-\(d\) load balancing in many-server systems
Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
The shorter queue polling model
Optimal control of a queueing system with an exponential and an Erlangian server and renewal input stream
Maximizing throughput in finite-source parallel queue systems
Optimal control of the service rate of an exponential queuing network using Markov decision theory
Martingale dynamics and optimal routing in a network
User equilibria for a parallel queueing system with state dependent routing
User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss
On Accommodating Customer Flexibility in Service Systems
Join the shortest queue with many servers. The heavy-traffic asymptotics
Allocation of flows in closed bipartite queueing networks
Last in line
Optimal QoS control of interacting service stations
Multi-layered round robin routing for parallel servers
Optimal Routing of Fixed Size Jobs to Two Parallel Servers
DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives
A 3-queue polling system with join the shortest-serve the longest policy
Asymptotic optimality of power-of-\(d\) load balancing in large-scale systems
Algorithms of distributed task allocation for cooperative agents
Dynamic routing to heterogeneous collections of unreliable servers
On the Shortest Queue Policy for the Tandem Parallel Queue
On the scheduling of operations in a chat contact center
Analysis of job assignment with batch arrivals among heterogeneous servers
Size- and state-aware dispatching problem with queue-specific job sizes
Optimizing Bernoulli routing policies for balancing loads on call centers and minimizing transmission costs
An optimal policy for joining a queue in processing two kinds of jobs

This page was built for publication: Optimality of the shortest line discipline

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