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.

No abstract

No abstract

A single server attends to two separate queues. Each queue has Poisson arrivals and a general service time distribution. A changeover time, with a general distribution, is required whenever the server crosses from one queue to the other. This paper investigates two queue disciplines: alternating priority and strict priority. In each case, it obtains the Laplace-Stieltjes transforms of the waiting-time distributions for a stationary process, as well as the first moments of the waiting-time distributions.

No abstract