Letter to the Editor---Bulk-Service Queuing Problem

N. K. Jaiswal
Additional contact information
N. K. Jaiswal: Operational Research Group, Defence Science Laboratory, Delhi, India

Operations Research, 1960, vol. 8, issue 1, 139-143

Abstract: Bailey [Bailey, N. T. J. 1954. On queuing processes with bulk service. J. Roy Stat. Soc. B 16 80--87.], using the “imbedded-Markov-chain” technique devised by Kendall [Kendall, D. G. 1951. Some problems in the theory of queues. J. Roy Stat. Soc. B 13 151--185; 1953. Stochastic processes occurring in the theory of queues and their analysis by the ‘imbedded Markov chain’. Ann. Math. Stat. 24 338--354.] presented a mathematical investigation of the type of queuing problem, in which customers arrive at random, form a single queue in order to arrival, and are served in batches, the size of each batch being either a fixed number s of customers or the total number in the queue, whichever is less. In the following note, the same problem has been solved by a different method.

Date: 1960
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.8.1.139 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:8:y:1960:i:1:p:139-143

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().