Comparing a Scheduled Process with an Analogous Poisson Process

Rodger D. Parker
Additional contact information
Rodger D. Parker: The Johns Hopkins University, Baltimore, Maryland

Operations Research, 1967, vol. 15, issue 1, 135-138

Abstract: The generating function of a queue in which n arrivals occur at fixed times, of equal intervals apart, and in which the service times are independently and identically distributed exponentially is derived in recursive form. The state probabilities are calculated explicitly for n = 1. An analogous recursion formula for the generating function of a related Poisson process is used to estimate whether the scheduled process may be approximated by a Poisson one. In no instance is the approximation a good one.

Date: 1967
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.15.1.135 (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:15:y:1967:i:1:p:135-138

Access Statistics for this article

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