BOUNDS AND AN APPROXIMATION FOR SINGLE SERVER QUEUES

Jeyaveerasingam George Shanthikumar

10 citations0/0 files storedJournal of the Operations Research Society of Japan

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 Statistical Research Probability and Risk Models

Abstract

In this note, we derive bounds for the waiting time in a single server queueing system with general independent arrival and general service times, using a regenerative process representation of this queue. We present easily computable new upper bounds for the variance and new upper and lower bounds for the second and higher moments of the waiting time. Also we present a simple approximation for the variance of waiting time.

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

References

1976Queueing Systems. Volume 1: Theory (Leonard Kleinrock)1970Inequalities in the Theory of Queues 1985On Approximate Queueing Models of Dynamic Job Shops 1980On the approximations to the single server queue 1974Bounds on the delay distribution inGI/G/1 queues 1973Queueing Theory in OR.1977AN APPROXIMATION FORMULA FOR THE MEAN WAITING TIME OF AN M/G/c QUEUE 1972A low traffic approximation for queues

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.