A Single-Server Queue with Recurrent Input and Exponentially Distributed Service Times

DOI10.1287/OPRE.10.3.395MaRDI QIDQ4772535zbMATH OpenOpenAlexFDO

Authors Lajos Takács

Publication date 1962

Published in Operations Research (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25)

Cited in

(3)

• Lattice path counting and \(M/M/c\) queueing systems
• The stochastic law of the busy period for a single-server queue with Poisson input
• Ein Algorithmus für das zeitabhängige Verhalten eingebetteter Markoff-Ketten bei den WartesystemenM (Y)/Gm/1 undGI m/M(Y)/1

This page was built for publication: A Single-Server Queue with Recurrent Input and Exponentially Distributed Service Times

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