Queues with Periodic Service and Changeover Time

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

This paper analyzes a queuing model consisting of a system of queues that are attended periodically (in a given order) by a single server. The server empties each queue before proceeding to the next queue in sequence. A changeover time is required whenever the server switches from one queue to another. For a stationary process expressions are obtained for the Laplace-Stieltjes transforms of the waiting-time and intervisit-time distributions at each queue. It is also shown how the moments of these distributions can be calculated.

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.