×

Imbedded Markov chain analysis for single server bulk queues. (English) Zbl 0124.34203


PDFBibTeX XMLCite
Full Text: DOI

References:

[1] DOI: 10.1007/BF02066673 · Zbl 0099.12704 · doi:10.1007/BF02066673
[2] Keilson, J. Roy. Stat. Soc. 24 pp 344– (1962)
[3] DOI: 10.2307/2310766 · Zbl 0114.09203 · doi:10.2307/2310766
[4] Bailey, J. Roy. Stat. Soc. B16 pp 80– (1954)
[5] Jaiswal, J. Roy. Stat. Soc. B23 pp 143– (1961)
[6] DOI: 10.1214/aoms/1177704870 · Zbl 0117.13504 · doi:10.1214/aoms/1177704870
[7] DOI: 10.1214/aoms/1177706200 · Zbl 0087.33601 · doi:10.1214/aoms/1177706200
[8] DOI: 10.1214/aoms/1177704867 · Zbl 0111.33101 · doi:10.1214/aoms/1177704867
[9] DOI: 10.2307/1993351 · Zbl 0107.13102 · doi:10.2307/1993351
[10] DOI: 10.2307/1993051 · Zbl 0071.13003 · doi:10.2307/1993051
[11] Prabhu, Sankkya 25 pp 281– (1963)
[12] DOI: 10.1214/aoms/1177728975 · Zbl 0051.10505 · doi:10.1214/aoms/1177728975
[13] Miller, J. Roy. Stat. Soc. 21 pp 320– (1959)
[14] Kemperman, The Passage Problem of a Stationary Markov Chain (1961)
[15] Feller, Probability and Statistics, Harald Cramer Volume pp 75– (1959)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.