×

Queuing with balking and reneging in \(M/G/1\) systems. (English) Zbl 0177.46004


MSC:

60K25 Queueing theory (aspects of probability theory)
90B22 Queues and service in operations research
PDFBibTeX XMLCite
Full Text: DOI EuDML

References:

[1] Ancker Jr., C. J. andA. V. Gafarian, (1962): Queuing with impatient customers who leave at random; Jour. of Ind. Engineering, Vol. XIII, 84–90.
[2] Ancker, Jr. C. J., andA. V. Gafarian, (1963): Some queuing problems with balking and reneging, I. Opns. Res. Vol. 11, 88–100. · Zbl 0109.36604 · doi:10.1287/opre.11.1.88
[3] Gaver, D. P. (1959): Imbedded Markov chain analysis of a waiting line in continuous time, Ann. Math. Stat. Vol. 30, 698–720. · Zbl 0087.33601 · doi:10.1214/aoms/1177706200
[4] Jaiswal, N. K. (1965): On some waiting line problems, Opsearch (India), Vol. 2, 27–43.
[5] Keilson, J. andA. Kooharian, (1960): On the time-dependent queuing processes. Ann. Math. Stat. Vol. 31, 104–112. · Zbl 0091.30302 · doi:10.1214/aoms/1177705991
[6] Smith, W. L. (1954): Asymptotic renewal theorems. Proc. Roy. Soc. Edinburgh. Sec. A, Vol. XIV, 9–48. · Zbl 0055.12402
[7] Subba Rao, S., (1965): Queuing models with balking, reneging and interruptions. Opns. Res. Vol. 13, 596–608. · Zbl 0253.60082 · doi:10.1287/opre.13.4.596
[8] Subba Rao, S. andN. K. Jaiswal, (1965): A queuing model with balking, reneging and limited server’s availability. Opsearch (India), Vol. 2, Nos. 3–4, 31–43. · Zbl 0203.18403
[9] Subba Rao, S. (1967): Queuing models with balking and reneging. Ann Inst. Stat. Math. (Japan). Vol. 19, 55–71. · Zbl 0153.20202 · doi:10.1007/BF02911668
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.