The slow server problem: a queue with stalling

Michael Rubinovitch

50 citations0/0 files storedJournal of Applied Probability

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Optimization and Search Problems Age of Information Optimization

Abstract

A queue with Poisson arrivals and two different exponential servers is considered. It is assumed that customers are allowed tostall, i.e., to wait for a busy fast server at times when the slow server is free. A stochastic analysis of the queue is given, steady-state probabilities are computed, and policies for overall optimization are characterized and computed. The issue of individual customer's optimization versus overall optimization is also discussed.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 50 citations exist upstream.

References

1969The Regulation of Queue Size by Levying Tolls 1983Individual versus Social Optimization in the Allocation of Customers to Alternative Servers 1985The slow server problem

Cited by

1998Operations management and reengineering 2014OPTIMAL CONTROL OF A TWO-SERVER QUEUEING SYSTEM WITH FAILURES 2020Scalable Load Balancing in the Presence of Heterogeneous Servers 2022Pooling Agents for Customer-Intensive Services 1994A duality approach to admission and scheduling controls of queues 2024Learning policies for resource allocation in business processes

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.