Answers are grounded in this paper and cite their sources.
This paper considers single-server, multi-queue systems with cyclic service. Non-zero switch-over times of the server between consecutive queues are assumed. A stochastic decomposition for the amount of work in such systems is obtained. This decomposition allows a short derivation of a ‘pseudo-conservation law' for a weighted sum of the mean waiting times at the various queues. Thus several recently proved conservation laws are generalised and explained.
No takes yet. Share an insight, caveat, or question.
Boxma et al. (1987) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: