The Busy Period of an M/G/1 Queue with Customer Impatience

Onno Boxma · David Perry · Wolfgang Stadje · Shelley Zacks

25 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 Probability and Risk Models Age of Information Optimization

Abstract

We consider an M/G/1 queue in which an arriving customer does not enter the system whenever its virtual waiting time, i.e. the amount of work seen upon arrival, is larger than a certain random patience time. We determine the busy period distribution for various choices of the patience time distribution. The main cases under consideration are exponential patience and a discrete patience distribution.

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 — 25 citations exist upstream.

References

1984Single-server queues with impatient customers 1957Queuing with Impatient Customers and Ordered Service 1981ON QUEUES WITH IMPATIENT CUSTOMERS.1979Reneging Phenomena in Single Channel Queues 1983Inventory systems of perishable commodities 1967Queuing with balking and reneging in M|G|1 systems 2000Busy period analysis for M/G/1 and G/M/1 type queues with restricted accessibility 1995Rejection rules in theM/G/1 queue

Cited by

2011The M/G/1+G queue revisited

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.