Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 949-964 |
| Number of pages | 16 |
| Journal | Journal of Applied Probability |
| Volume | 24 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1987 |