Deciding Which Queue to Join: Some Counterexamples
From MaRDI portal
Publication:3760275
DOI10.1287/opre.34.1.55zbMath0622.90035WikidataQ124978689 ScholiaQ124978689MaRDI QIDQ3760275
Publication date: 1986
Published in: Operations Research (Search for Journal in Brave)
queueing systemfirst-come first-servedlong-run average delayqueue with infinite capacitystochastic arrival processtwo or more servers
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (54)
To Pool or Not to Pool: Queueing Design for Large-Scale Service Systems ⋮ A Fair Policy for the G/GI/N Queue with Multiple Server Pools ⋮ Insensitive versus efficient dynamic load balancing in networks without blocking ⋮ The shorter queue polling model ⋮ Probabilistic selfish routing in parallel batch and single-server queues ⋮ Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing ⋮ Strategic Customers in a Transportation Station: When Is It Optimal to Wait? ⋮ Optimal control of multiclass parallel service systems ⋮ User equilibria for a parallel queueing system with state dependent routing ⋮ Optimality of the shortest line discipline with state-dependent service rates ⋮ Sample path methods in the control of queues ⋮ On balking from an empty queue ⋮ Waiting time based routing policies to parallel queues with percentiles objectives ⋮ Analysis of queueing systems with customer interjections ⋮ Stationary analysis of the shortest queue problem ⋮ Stability of Parallel Server Systems ⋮ Steady-state analysis of shortest expected delay routing ⋮ STRATEGIC DYNAMIC JOCKEYING BETWEEN TWO PARALLEL QUEUES ⋮ Universality of Power-of-d Load Balancing in Many-Server Systems ⋮ Asymptotically optimal component assembly plans in repairable systems and server allocation in parallel multiserver queues ⋮ Monotonicity properties of user equilibrium policies for parallel batch systems ⋮ A case for on-machine load balancing ⋮ Analysis of job assignment with batch arrivals among heterogeneous servers ⋮ Size- and state-aware dispatching problem with queue-specific job sizes ⋮ A conservative index heuristic for routing problems with multiple heterogeneous service facilities ⋮ To split or not to split: selecting the right server with batch arrivals ⋮ Optimality of routing and servicing in dependent parallel processing systems ⋮ The effects of information on a queue with balking and phase‐type service times ⋮ On the Value Function of the M/G/1 FCFS and LCFS Queues ⋮ On the stability of a class of non-monotonic systems of parallel queues ⋮ Cascade equilibrium strategies in a two-server queueing system with inspection cost ⋮ On the scheduling of operations in a chat contact center ⋮ Multi-layered round robin routing for parallel servers ⋮ Pure threshold strategies for a two-node tandem network under partial information ⋮ Task allocation in multiserver systems -- a survey of results. ⋮ Replicate to the shortest queues ⋮ Asymptotically optimal control of parallel tandem queues with loss ⋮ Stability of a priority queueing system with customer transfers ⋮ Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling ⋮ Networks of infinite-server queues with nonstationary Poisson input ⋮ A survey of Markov decision models for control of networks of queues ⋮ Strategic customer behavior in a two-stage batch processing system ⋮ Martingales and buffer overflow for the symmetric shortest queue model ⋮ Dynamic Distribution of Patients to Medical Facilities in the Aftermath of a Disaster ⋮ Algorithms for the upper bound mean waiting time in the \(\mathrm{GI}/\mathrm{GI}/1\) queue ⋮ DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM ⋮ User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss ⋮ Multiple-server system with flexible arrivals ⋮ On the stationary distribution of queue lengths in a multi-class priority queueing system with customer transfers ⋮ CHARACTERISTICS OF DETERMINISTIC OPTIMAL ROUTING FOR TWO HETEROGENEOUS PARALLEL SERVERS ⋮ The Downs-Thomson paradox: existence, uniqueness and stability of user equilibria ⋮ A general ``power-of-\(d\) dispatching framework for heterogeneous systems ⋮ Signaling for decentralized routing in a queueing network ⋮ A nonparametric predictive method for queues
This page was built for publication: Deciding Which Queue to Join: Some Counterexamples
