On the optimal assignment of customers to parallel servers
From MaRDI portal
Publication:4157788
DOI10.2307/3213411zbMATH Open0378.60095OpenAlexW2064823719MaRDI QIDQ4157788FDOQ4157788
Authors: Richard Weber
Publication date: 1978
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3213411
Cited In (64)
- Distributed dispatching in the parallel server model
- Performance balancing size-interval routing policies
- Queue-length-aware dispatching in large-scale heterogeneous systems
- Persistent-idle load-distribution
- Optimal Routing of Fixed Size Jobs to Two Parallel Servers
- On the Shortest Queue Policy for the Tandem Parallel Queue
- Stability of parallel server systems
- Control of arrivals to two queues in series
- DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
- STRATEGIC DYNAMIC JOCKEYING BETWEEN TWO PARALLEL QUEUES
- Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
- 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
- Monotonicity properties of user equilibrium policies for parallel batch systems
- On the Optimality of the Generalized Shortest Queue Policy
- User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss
- Analysis of job assignment with batch arrivals among heterogeneous servers
- Universality of power-of-\(d\) load balancing in many-server systems
- Choosing among heterogeneous server clouds
- Asymptotic optimality of power-of-\(d\) load balancing in large-scale systems
- A conservative index heuristic for routing problems with multiple heterogeneous service facilities
- Partial flexibility in routeing and scheduling
- Multiscale Q-learning with linear function approximation
- Multiple-server system with flexible arrivals
- Optimal control of multiclass parallel service systems
- A survey of Markov decision models for control of networks of queues
- Delay-join the shortest queue routing for a parallel queueing system with removable servers
- Scheduling service in tandem queues attended by a single server
- Maximizing throughput in finite-source parallel queue systems
- A nonparametric predictive method for queues
- Performance bounds for the effectiveness of pooling in multi-processing systems
- A load balancing system in the many-server heavy-traffic asymptotics
- Transform methods for heavy-traffic analysis
- Steady-state analysis of load-balancing algorithms in the sub-Halfin-Whitt regime
- Characteristics of deterministic optimal routing for two heterogeneous parallel servers
- Understanding the marginal impact of customer flexibility
- Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing
- Dynamic routing to heterogeneous collections of unreliable servers
- Throughput and delay optimality of power-of-\(d\) choices in inhomogeneous load balancing systems
- Optimal dynamic load distribution in a class of flow-type flexible manufacturing systems
- Dynamics of the non-homogeneous supermarket model
- Sample path methods in the control of queues
- On the value function of the M/G/1 FCFS and LCFS queues
- Martingales and buffer overflow for the symmetric shortest queue model
- Stationary analysis of the shortest queue problem
- Power-of-d-Choices with Memory: Fluid Limit and Optimality
- Optimality of routing and servicing in dependent parallel processing systems
- Task allocation in multiserver systems -- a survey of results.
- On the average optimality of circular assignment policy
- Shortest expected delay routing for Erlang servers
- An overview for Markov decision processes in queues and networks
- To pool or not to pool: queueing design for large-scale service systems
- 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
- 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
- System planning and configuration problems for optimal system design
- Practical load balancing for content requests in peer-to-peer networks
- Optimal QoS control of interacting service stations
- A general ``power-of-\(d\) dispatching framework for heterogeneous systems
- Signaling for decentralized routing in a queueing network
- Stochastically minimizing the number of customers in exponential queueing systems
This page was built for publication: On the optimal assignment of customers to parallel servers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4157788)