Answers are grounded in this paper and cite their sources.
Single-served, multiqueue systems with cyclic service in discrete time are considered. Nonzero switchover times between consecutive queues are assumed; the service strategies at the various queues may differ. A decomposition for the amount of work in such systems is obtained, leading to an exact expression for a weighted sum of the mean waiting times at the various queues.>
No takes yet. Share an insight, caveat, or question.
Boxma et al. (1988) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: