Discrete-Time Queuing Theory

Torben Meisling
Additional contact information
Torben Meisling: Division of Engineering Research, Stanford Research Institute, Menlo Park, California

Operations Research, 1958, vol. 6, issue 1, 96-105

Abstract: This paper contains an analysis of a single-server queuing system for which time is treated as a discrete variable. The number of customers arriving within a fixed time interval is assumed to obey a binomial probability distribution. The service times are assumed to be identically distributed and statistically independent but are not otherwise restricted. It is furthermore assumed that customers are served in their order of arrival. Formulas for the mean queue length and the mean waiting time are derived for the general case and it is shown how the previously obtained results for the corresponding continuous-time system may be derived from the results given here by a limiting process. The results are applied to two special cases, (1) a service-time distribution, which has the form of a geometrical progression, and (2) a fixed service-time distribution.

Date: 1958
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.6.1.96 (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:6:y:1958:i:1:p:96-105

Access Statistics for this article

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