About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Waiting-time approximations for cyclic-service systems with switchover times
Abstract
Mean waiting-time approximations are derived for a single-server multi-queue system with nonexhaustive cyclic service. Nonzero switchover times of the server between consecutive queues are assumed. The main tool used in the derivation is a pseudo-conservation law recently found by Watson (1984). The approximation is simpler and, as extensive simulations show, more accurate than existing approximations. Moreover, it gives very good insight into the qualitative behaviour of cyclic-service queueing systems. © 1987.