A single-server queue with Poisson arrivals and exponential service is studied to obtain the joint probability distribution of the number in the system at time t and the cumulative number already served at time t. The probability that k are served in time t is then determined.
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.