Note—On the Merits of an “Approximation” to the Busy Period of the GI/G/1 Queue

DOI10.1287/MNSC.25.3.285zbMATH Open0411.60094OpenAlexW2071542032MaRDI QIDQ4197863FDOQ4197863

David M. Lucantoni, Vaidyanathan Ramaswami

Publication date: 1979

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.25.3.285

zbMATH Keywords

queueing theoryrenewal processescomputing the busy period characteristicspractical algorithmic methods

Mathematics Subject Classification ID

Probabilistic models, generic numerical methods in probability and statistics (65C20) Queueing theory (aspects of probability theory) (60K25) Renewal theory (60K05)

Cited In (1)

• Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs

This page was built for publication: Note—On the Merits of an “Approximation” to the Busy Period of the GI/G/1 Queue

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4197863)