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