Waiting times in discrete-time cyclic-service systems

Abstract

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.>

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 86 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.