Optimality of the shortest line discipline
From MaRDI portal
Publication:4130153
DOI10.2307/3213271zbMATH Open0357.60023OpenAlexW1997049009MaRDI QIDQ4130153FDOQ4130153
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
Cited In (93)
- Optimal Routing of Fixed Size Jobs to Two Parallel Servers
- A 3-queue polling system with join the shortest-serve the longest policy
- On the Shortest Queue Policy for the Tandem Parallel Queue
- Control of arrivals to two queues in series
- Bad luck when joining the shortest queue
- 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
- On the Assignment of Customers to Parallel Queues
- Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
- Optimal control of a queueing system with an exponential and an Erlangian server and renewal input stream
- Martingale dynamics and optimal routing in a network
- Job assignment in large-scale service systems with affinity relations
- Monotonicity properties of user equilibrium policies for parallel batch systems
- On the Optimality of the Generalized Shortest Queue Policy
- Insensitive versus efficient dynamic load balancing in networks without blocking
- User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss
- On the scheduling of operations in a chat contact center
- Asymptotically optimal control of parallel tandem queues with loss
- CHARACTERISTICS OF DETERMINISTIC OPTIMAL ROUTING FOR TWO HETEROGENEOUS PARALLEL SERVERS
- 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
- Balancing queues by mean field interaction
- Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging
- Analysis of job assignment with batch arrivals among heterogeneous servers
- Size- and state-aware dispatching problem with queue-specific job sizes
- An optimal policy for joining a queue in processing two kinds of jobs
- 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
- To Pool or Not to Pool: Queueing Design for Large-Scale Service Systems
- Waiting time based routing policies to parallel queues with percentiles objectives
- Multiple-server system with flexible arrivals
- 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
- 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
- User equilibria for a parallel queueing system with state dependent routing
- Stability of Parallel Server Systems
- Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives
- Understanding the marginal impact of customer flexibility
- Dynamic routing to heterogeneous collections of unreliable servers
- Asymptotic Optimality of Power-of-d Load Balancing in Large-Scale Systems
- Dynamic priority allocation via restless bandit marginal productivity indices
- Sample path methods in the control of queues
- Stationary analysis of the shortest queue problem
- Optimality of routing and servicing in dependent parallel processing systems
- On the average optimality of circular assignment policy
- 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
- Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
- Multi-layered round robin routing for parallel servers
- Optimality of the shortest line discipline with state-dependent service rates
- Dynamic Scheduling of a Four-Station Queueing Network
- On Accommodating Customer Flexibility in Service Systems
- Algorithms of distributed task allocation for cooperative agents
- Optimal control of the service rate of an exponential queuing network using Markov decision theory
- Practical load balancing for content requests in peer-to-peer networks
- Optimal QoS control of interacting service stations
- Steady-state analysis of load-balancing algorithms in the sub-Halfin–Whitt regime
- Stochastically minimizing the number of customers in exponential queueing systems
- Universality of Power-of-d Load Balancing in Many-Server Systems
- Distributed dispatching in the parallel server model
- Self-Learning Threshold-Based Load Balancing
- Delay-Join the Shortest Queue Routing for a Parallel Queueing System with Removable Servers
- Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
- A polling system with `join the shortest -- serve the longest' policy
- Transform Methods for Heavy-Traffic Analysis
- Persistent-Idle Load-Distribution
- Open Problem—Load Balancing Using Delayed Information
- On the Value Function of the M/G/1 FCFS and LCFS Queues
- Performance balancing size-interval routing policies
- Choosing among heterogeneous server clouds
- Partial flexibility in routeing and scheduling
- Queue-length-aware dispatching in large-scale heterogeneous systems
- Stochastic coordination in heterogeneous load balancing systems
- OPTIMAL ADMISSION AND ROUTING WITH CONGESTION-SENSITIVE CUSTOMER CLASSES
- A load balancing system in the many-server heavy-traffic asymptotics
- Throughput and delay optimality of power-of-\(d\) choices in inhomogeneous load balancing systems
- Martingales and buffer overflow for the symmetric shortest queue model
- Mean-field fluctuations at diffusion scale in threshold-based randomized routing for processor sharing systems and applications
- Power-of-d-Choices with Memory: Fluid Limit and Optimality
- Zero-wait load balancing with sparse messaging
- Task allocation in multiserver systems -- a survey of results.
- A Fair Policy for the G/GI/N Queue with Multiple Server Pools
- A lower bound on the queueing delay in resource constrained load balancing
- The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times
- 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)