On the discrete‐time queue length distribution under markov‐dependent phases

M. L. Chaudhry

Naval Research Logistics Quarterly, 1972, vol. 19, issue 2, 369-378

Abstract: The technique of probability generating functions has been applied to solve the steady state behavior of a discrete‐time, single‐channel, queueing problem wherein the arrivals to the queue at consecutive time‐marks are statistically independent, but the service is accomplished in phases which are Markov‐dependent. Special cases of importance have been discussed. In the end, mean number of phases, its special cases, the mean queue lengths, and the variances have been ascertained.

Date: 1972
References: Add references at CitEc
Citations:

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

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:19:y:1972:i:2:p:369-378

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