Transient solution of a finite‐capacity M/Ga,b/1 queueing system

M. J. Jacob, A. Krishnamoorthy and T. P. Madhusoodanan

Naval Research Logistics (NRL), 1988, vol. 35, issue 3, 437-441

Abstract: In this article we consider a single‐server, bulk‐service queueing system in which the waiting room is of finite capacity. Arrival process is Poisson and all the arrivals taking place when the waiting room is full are lost. The service times are generally distributed independent random variables and the distribution is depending on the batch size being served. Using renewal theory, we derive the time‐dependent solution for the system‐size probabilities at arbitrary time points. Also we give expressions for the distribution of virtual waiting time in the queue at any time t.

Date: 1988
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/1520-6750(198806)35:33.0.CO;2-W

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:navres:v:35:y:1988:i:3:p:437-441

Access Statistics for this article

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