Further Results for the Queue with Poisson Arrivals

Published Online:https://doi.org/10.1287/opre.11.3.380

Transition probabilities are obtained for the queue length in the single-server system with Poisson arrivals and arbitrary service time distribution. The method used is applicable to systems with batch arrivals and balking, discussed respectively by D. P. Gaver and Lajos Takács.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.