Summary
This paper discusses the ergodic queue length distribution of a bulk service system with finite waiting space by the method of the imbedded Markov chain. The system under consideration is a queuing system with Poisson arrivals, general service times, single server and where service is performed on batches of random size.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
U. N. Bhat, Customer Overflow in Queues with Finite Waiting Space,Australian Journal of Statistics, 7, No. 1, (1965) 15–19.
U. N. Bhat, Imbedded Markov Chains in Queuing System M/G/1 and GI/M/1 with Limited Waiting Room,Research Report, Department of Statistics, Michigan State University, Feb 25, 1966. (Abstract appears inAMS, 37, No. 2 (1966) 540.
P. D. Finch, The Effect of the Size of the Waiting Room on a Simple Queue,Journal of the Royal Statistical Society, Series B, 20, No. 1 (1958) 182–186.
H. C. Jain, Queuing Problem with Limited Waiting Space,Naval Research Logistics Quarterly, 9, No. 3 (1962) 245–252.
N. K. Jaiswal, On Some Waiting Line Problems,Opsearch, 2, No. 1 and 2 (1965) 27–43.
J. Keilson, The Ergodic Queue Length Distribution for Queuing Systems with Finite Capacity,Journal of the Royal Statistical Society, Series C, Parts 2 and 3 (1965) 190–201.
S. S. Rao, Queuing Models with Balking, Reneging and Interruptions,Operations Research, 13, No. 4 (1965) 596–608.
V. P. Singh, Finite Storage Problems via Queuing Theory,Master's Thesis, Ohio State University, 1967.
S. Takamatsu, On the Come-and-Stay Interarrival Time in a Modified Queuing System M/G/1,Ann. Inst. Statist. Math., 15 (1963) 73–78.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Singh, V.P. Finite waiting space bulk service system. J Eng Math 5, 241–248 (1971). https://doi.org/10.1007/BF01548241
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01548241