Occupation Time Problems in the Theory of Queues

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

The author considers a single-server queue and deals with the problem of finding the distribution of the total occupation time of the server in the time interval (0, t) and the distribution of the number of services among the first n services that are not preceded by an idle period. The author also points out the use of the results in the theory of dams.

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.