The Remaining Busy Period of a Finite Queue

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

In the M/G/1/N queuing system where no more than N < ∞ customers are allowed in the system, define the remaining busy period from state i = 0, 1, …, N as the time spent in transition from state i to state 0, i.e., until the server becomes idle for the first time. The purpose of this paper is to derive the Laplace-Stieltjes transform of the distribution of this time and the generating function of the number of customers served in this time.

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.