Pseudo-cyclic policies for multi-queue single server systems

DOI10.1007/BF02023096zbMath0787.90029OpenAlexW2067189116MaRDI QIDQ1315338

Hanoch Levy, Offer Fabian

Publication date: 10 March 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02023096

zbMATH Keywords

stochastic dominancecycle-time guided algorithmssemi-dynamic polling modelswaiting time performance

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queues and service in operations research (90B22)

Related Items (2)

Polling: past, present, and perspective ⋮ Mathematical methods to study the polling systems

Cites Work

• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Pseudo-cyclic policies for multi-queue single server systems