Deciding Which Queue to Join: Some Counterexamples
From MaRDI portal
Recommendations
- A note on joining strategies for two queues in parallel
- Joining the right queue: a state-dependent decision rule
- Counterexamples for comparisons of queues with finite waiting rooms
- Join the shortest queue: Stability and exact asymptotics
- An optimal policy for joining a queue in processing two kinds of jobs
- Join the shortest queue with many servers. The heavy-traffic asymptotics
- scientific article; zbMATH DE number 19795
- scientific article; zbMATH DE number 3069542
- Queues with choice from a symmetry perspective
Cited in
(66)- The Downs-Thomson paradox: existence, uniqueness and stability of user equilibria
- Optimal Entering Rules for a Customer with Wait Option at an M/G/1 Queue
- Erlang arrivals joining the shorter queue
- Stability of parallel server systems
- The shorter queue polling model
- DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
- Observing Queues Before Joining
- STRATEGIC DYNAMIC JOCKEYING BETWEEN TWO PARALLEL QUEUES
- Strategic customers in a transportation station: when Is it optimal to wait?
- To split or not to split: selecting the right server with batch arrivals
- Monotonicity properties of user equilibrium policies for parallel batch systems
- Insensitive versus efficient dynamic load balancing in networks without blocking
- User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss
- Joining the right queue: a state-dependent decision rule
- Cascade equilibrium strategies in a two-server queueing system with inspection cost
- On the scheduling of operations in a chat contact center
- Asymptotically optimal control of parallel tandem queues with loss
- Analysis of job assignment with batch arrivals among heterogeneous servers
- Size- and state-aware dispatching problem with queue-specific job sizes
- Asymptotically optimal component assembly plans in repairable systems and server allocation in parallel multiserver queues
- On the stationary distribution of queue lengths in a multi-class priority queueing system with customer transfers
- Personalized queues: the customer view, via a fluid model of serving least-patient first
- Networks of infinite-server queues with nonstationary Poisson input
- Observing general service queues before joining
- Universality of power-of-d load balancing in many-server systems
- A conservative index heuristic for routing problems with multiple heterogeneous service facilities
- Concurrent counting is harder than queuing
- A fair policy for the \(\mathrm{G}/\mathrm{GI}/N\) queue with multiple server pools
- Probabilistic selfish routing in parallel batch and single-server queues
- Waiting time based routing policies to parallel queues with percentiles objectives
- Optimal control of multiclass parallel service systems
- A note on joining strategies for two queues in parallel
- Multiple-server system with flexible arrivals
- A survey of Markov decision models for control of networks of queues
- A nonparametric predictive method for queues
- Queue-length-aware dispatching in large-scale heterogeneous systems
- User equilibria for a parallel queueing system with state dependent routing
- Replicate to the shortest queues
- A case for on-machine load balancing
- Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing
- On balking from an empty queue
- Characteristics of deterministic optimal routing for two heterogeneous parallel servers
- Strategic customer behavior in a two-stage batch processing system
- Algorithms for the upper bound mean waiting time in the \(\mathrm{GI}/\mathrm{GI}/1\) queue
- Sample path methods in the control of queues
- Stability of a priority queueing system with customer transfers
- The effects of information on a queue with balking and phase-type service times
- 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
- Steady-state analysis of shortest expected delay routing
- Equilibrium in queues under unknown service times and service value
- Task allocation in multiserver systems -- a survey of results.
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
- Pure threshold strategies for a two-node tandem network under partial information
- To pool or not to pool: queueing design for large-scale service systems
- Multi-layered round robin routing for parallel servers
- On Waiting for Simultaneous Access to Two Resources
- Optimality of the shortest line discipline with state-dependent service rates
- On the stability of a class of non-monotonic systems of parallel queues
- Dynamic Distribution of Patients to Medical Facilities in the Aftermath of a Disaster
- The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times
- Analysis of queueing systems with customer interjections
- A general ``power-of-\(d\) dispatching framework for heterogeneous systems
- Signaling for decentralized routing in a queueing network
This page was built for publication: Deciding Which Queue to Join: Some Counterexamples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3760275)
