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

R. R. P. Jackson | Zendy; P. Aspden | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

R. R. P. Jackson,

P. Aspden

Publication year - 1980

Publication title -

operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.797

H-Index - 140

eISSN - 1526-5463

pISSN - 0030-364X

DOI - 10.1287/opre.28.3.618

Subject(s) - server , computer science , queue , poisson distribution , queueing theory , exponential function , exponential distribution , series (stratigraphy) , mathematics , mathematical optimization , service (business) , tandem , stage (stratigraphy) , process (computing) , computer network , statistics , mathematical analysis , paleontology , materials science , economy , economics , composite material , biology , operating system

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research