Pseudo-cyclic policies for multi-queue single server systems
From MaRDI portal
Publication:1315338
DOI10.1007/BF02023096zbMath0787.90029MaRDI QIDQ1315338
Publication date: 10 March 1994
Published in: Annals of Operations Research (Search for Journal in Brave)
stochastic dominance; cycle-time guided algorithms; semi-dynamic polling models; waiting time performance
90B18: Communication networks in operations research
90B22: Queues and service in operations research
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Dominance relations in polling systems
- Efficient visit frequencies for polling tables: Minimization of waiting cost
- On optimal polling policies
- On optimal right-of-way policies at a single-server station when insertion of idle times is permitted
- Dynamic priority rules for cyclic-type queues
- On the Optimal Control of Two Queues with Server Setup Times and Its Analysis