Simple Inequalities for the D/G/1 Queue

DOI10.1287/opre.35.4.589zbMath0652.60102OpenAlexW1993637993MaRDI QIDQ3798011

Teunis J. Ott

Publication date: 1987

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.35.4.589

zbMATH Keywords

upper and lower boundsexpected waiting timeprobability of no waiting

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (2)

Extremal \(GI/GI/1\) queues given two moments: exploiting Tchebycheff systems ⋮ Algorithms for the upper bound mean waiting time in the \(\mathrm{GI}/\mathrm{GI}/1\) queue

This page was built for publication: Simple Inequalities for the D/G/1 Queue