The Probability Law of the Busy Period for Two Types of Queuing Processes
From MaRDI portal
Publication:3847306
DOI10.1287/opre.9.3.402zbMath0111.33102OpenAlexW1999910105MaRDI QIDQ3847306
Publication date: 1961
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.9.3.402
Related Items
The stochastic law of the busy period for a single-server queue with Poisson input, The busy periods of some queueing systems, Calculating the \(M/G/1\) busy-period density and LIFO waiting-time distribution by direct numerical transform inversion, A transient analysis of M/G/1 queues with N-policy, The distribution of majority times in a ballot, Generalizations of the ballot problem, Ein Algorithmus für das zeitabhängige Verhalten eingebetteter Markoff-Ketten bei den WartesystemenM (Y)/Gm/1 undGI m/M(Y)/1, A combinatorial method in the theory of Markov chains, On mutations in the branching model for multitype populations, Lattice path combinatorics and linear probing