Optimality of the shortest line discipline
From MaRDI portal
Publication:4130153
DOI10.2307/3213271zbMath0357.60023OpenAlexW1997049009MaRDI QIDQ4130153
Publication date: 1977
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3213271
Related Items
To Pool or Not to Pool: Queueing Design for Large-Scale Service Systems ⋮ Performance balancing size-interval routing policies ⋮ Choosing among heterogeneous server clouds ⋮ Stochastically minimizing the number of customers in exponential queueing systems ⋮ Delay-Join the Shortest Queue Routing for a Parallel Queueing System with Removable Servers ⋮ A Fair Policy for the G/GI/N Queue with Multiple Server Pools ⋮ OPTIMAL ADMISSION AND ROUTING WITH CONGESTION-SENSITIVE CUSTOMER CLASSES ⋮ Resource allocation and routing in parallel multi-server queues with abandonments for cloud profit maximization ⋮ Practical load balancing for content requests in peer-to-peer networks ⋮ Bad luck when joining the shortest queue ⋮ Optimal QoS control of interacting service stations ⋮ Allocation of flows in closed bipartite queueing networks ⋮ Dynamic routing to heterogeneous collections of unreliable servers ⋮ Insensitive versus efficient dynamic load balancing in networks without blocking ⋮ The shorter queue polling model ⋮ On computing average cost optimal policies with application to routing to parallel queues ⋮ Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives ⋮ Martingale dynamics and optimal routing in a network ⋮ A load balancing system in the many-server heavy-traffic asymptotics ⋮ Optimal control of multiclass parallel service systems ⋮ An optimal policy for joining a queue in processing two kinds of jobs ⋮ Self-Learning Threshold-Based Load Balancing ⋮ User equilibria for a parallel queueing system with state dependent routing ⋮ Optimality of the shortest line discipline with state-dependent service rates ⋮ Approximating the mean response time of parallel queues with JSQ policy ⋮ Sample path methods in the control of queues ⋮ Understanding the marginal impact of customer flexibility ⋮ Scalable Load Balancing in Networked Systems: A Survey of Recent Advances ⋮ Zero-wait load balancing with sparse messaging ⋮ Waiting time based routing policies to parallel queues with percentiles objectives ⋮ Stationary analysis of the shortest queue problem ⋮ Stability of Parallel Server Systems ⋮ Stochastic coordination in heterogeneous load balancing systems ⋮ A lower bound on the queueing delay in resource constrained load balancing ⋮ A 3-queue polling system with join the shortest-serve the longest policy ⋮ Routing jobs with deadlines to heterogeneous parallel servers ⋮ On Accommodating Customer Flexibility in Service Systems ⋮ Optimal Routing of Fixed Size Jobs to Two Parallel Servers ⋮ Optimal control of a queueing system with an exponential and an Erlangian server and renewal input stream ⋮ Joint routing and scheduling control in a two-class network with a flexible server ⋮ Universality of Power-of-d Load Balancing in Many-Server Systems ⋮ Open Problem—Load Balancing Using Delayed Information ⋮ Monotonicity properties of user equilibrium policies for parallel batch systems ⋮ Persistent-Idle Load-Distribution ⋮ Analysis of job assignment with batch arrivals among heterogeneous servers ⋮ Size- and state-aware dispatching problem with queue-specific job sizes ⋮ 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 ⋮ Transform Methods for Heavy-Traffic Analysis ⋮ Optimality of routing and servicing in dependent parallel processing systems ⋮ Steady-state analysis of load-balancing algorithms in the sub-Halfin–Whitt regime ⋮ On the Value Function of the M/G/1 FCFS and LCFS Queues ⋮ On the scheduling of operations in a chat contact center ⋮ On the average optimality of circular assignment policy ⋮ Stochastic relations of random variables and processes ⋮ Optimal control of the service rate of an exponential queuing network using Markov decision theory ⋮ Multi-layered round robin routing for parallel servers ⋮ Task allocation in multiserver systems -- a survey of results. ⋮ Dynamic routing in a distributed parallel many-server service system: the effect of \(\xi \)-choice ⋮ 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 ⋮ Endogenous queue number determination in \(G/m/s\) systems ⋮ Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling ⋮ A survey of Markov decision models for control of networks of queues ⋮ Martingales and buffer overflow for the symmetric shortest queue model ⋮ Last in line ⋮ Job assignment in large-scale service systems with affinity relations ⋮ Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics ⋮ Power-of-d-Choices with Memory: Fluid Limit and Optimality ⋮ Asymptotic Optimality of Power-of-d Load Balancing in Large-Scale Systems ⋮ Throughput and delay optimality of power-of-\(d\) choices in inhomogeneous load balancing systems ⋮ DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM ⋮ Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games ⋮ User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss ⋮ Multiple-server system with flexible arrivals ⋮ Algorithms of distributed task allocation for cooperative agents ⋮ Optimizing Bernoulli routing policies for balancing loads on call centers and minimizing transmission costs ⋮ Dynamic Scheduling of a Four-Station Queueing Network ⋮ On the Optimality of the Generalized Shortest Queue Policy ⋮ On the Shortest Queue Policy for the Tandem Parallel Queue ⋮ On the Assignment of Customers to Parallel Queues ⋮ CHARACTERISTICS OF DETERMINISTIC OPTIMAL ROUTING FOR TWO HETEROGENEOUS PARALLEL SERVERS ⋮ Balancing queues by mean field interaction ⋮ Partial Flexibility in Routeing and Scheduling ⋮ A polling system with `join the shortest -- serve the longest' policy ⋮ A general ``power-of-\(d\) dispatching framework for heterogeneous systems ⋮ Signaling for decentralized routing in a queueing network ⋮ Control of arrivals to two queues in series
