Queues with batch poisson arrivals and hyper‐exponential service

S. K. Cupta and J. K. Goyal

Naval Research Logistics Quarterly, 1965, vol. 12, issue 3, 323-329

Abstract: We consider in this paper the queueing system in which the input is in batches of variable numbers following a Poisson distribution; queue discipline is “first come first served,” it being assumed that the batches are preordered for service purposes; and service time distribution is hyperexponential with n branches. The Laplace transform of the system size distribution is determined by applying the method of generating functions, devised by Bailey [1] . Some of the known results are derived as particular cases.

Date: 1965
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800120308

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:wly:navlog:v:12:y:1965:i:3:p:323-329

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().