On the Busy Periods of Single-Server Queues with Poisson Input and General Service Times

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

We consider a single-server queue with Poisson input and general service times and determine the following probabilities: the probability that a busy period has length ≦ x and the maximal queue size during the busy period is ≦ k, and the probability that a busy period has length ≦ x and the maximal virtual waiting time during the busy period is ≦ y.

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.