The performance of single-server queues with independent interarrival intervals and service demands is well understood, and often analytically tractable. In particular, the M/M/1 queue has been thoroughly studied, due to its analytical tractability. Little is known, though, when autocorrelation...

This paper provides the expected waiting time of a nonsymmetric cyclic server queueing system with Poisson traffic, arbitrary switchover and arbitrary service times. For n the number of queues, the expected waiting time is obtained using n equations which is a significant improvement over the...

Sarkar and Zangwill (1991) showed by numerical examples that reduction in setup times can, surprisingly, actually increase work in process in some cyclic production systems (that is, reduction in switchover times can increase waiting times in some polling models). We present, for polling models...

An algorithm is given for computing the serial correlations of the waiting time, and of the time in system, for successive customers in a GI/G/1 queue. The method depends on representing the inter-arrival time distribution in terms of a process in class K_r (i.e., distributions with a rational...