An M/G/1 queue with finite buffer capacity and server vacation schedules dependent on occupancy level is studied. The blocking probability is expressed simply in terms of the ergodic queue length probabilities for the infinite buffer case.
J. Keilson, L. D. Servi, (1989) Blocking Probability for M/G/1 Vacation Systems with Occupancy Level Dependent Schedules. Operations Research 37(1):134-140.
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.