A finite capacity GI/PH/1 queue with group services

S. Chakravarthy

Naval Research Logistics (NRL), 1992, vol. 39, issue 3, 345-357

Abstract: We consider a finite‐capacity single‐server queue in which arrivals occur one at a time, according to a renewal process. The successive service times are mutually independent and have a common phase‐type distribution. The customers are served in groups of size at least L, a preassigned threshold value. Explicit analytic expressions for the steady‐state queue‐length densities at arrivals and at arbitrary time points, and the throughput of the system are obtained. The Laplace‐Stieltjes transform of the stationary waiting‐time distribution of an admitted customer at points of arrivals is computed. It is shown to be of phase type when the arrival process is also of phase type. Efficient algorithmic procedures for the steady‐state analysis of the model are presented. These procedures are used in arriving at an optimal value for L that minimizes the mean waiting time of an admitted customer. A conjecture on the nature of the mean waiting time is proposed.

Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199204)39:33.0.CO;2-V

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:39:y:1992:i:3:p:345-357

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 ().