Technical Note—A Transient Solution to the Multistage Poisson Queueing System with Infinite Servers

R. R. P. Jackson and P. Aspden
Additional contact information
R. R. P. Jackson: Department of Health and Social Security, London, England
P. Aspden: Department of Health and Social Security, London, England

Operations Research, 1980, vol. 28, issue 3-part-i, 618-622

Abstract: This paper gives an alternative method of deriving the time dependent solution of a multistage nonqueueing process, with random arrivals into the first stage of the system, sufficient servers at each stage and exponential service time distributions. In the standard notation, the system is a finite number of M / M /∞ queues in series (tandem). This method has the advantage over previous methods of being able to solve the case when any of the stage average service times are equal. The solution was obtained during a project concerned with developing a mathematical model of Acute Myeloid Leukemia patient progress.

Date: 1980
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.28.3.618 (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:28:y:1980:i:3-part-i:p:618-622

Access Statistics for this article

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