Dynamic priority rules when polling with multiple parallel servers

DOI10.1016/0167-6377(92)90096-LzbMath0759.90035MaRDI QIDQ1200777

Sid Browne, Gideon Weiss

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

stochastic schedulingparallel processingpolling systemsqueueing networkindex policiesdynamic priority rules

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (3)

Polling: past, present, and perspective ⋮ Polling systems with multiple coupled servers ⋮ Mathematical methods to study the polling systems

Cites Work

• Unnamed Item
• Workloads and waiting times in single-server systems with multiple customer classes
• Gated, Exhaustive, Parallel Service
• Scheduling Deteriorating Jobs on a Single Processor
• Optimal Repair Allocation in a Series System
• Dynamic priority rules for cyclic-type queues

This page was built for publication: Dynamic priority rules when polling with multiple parallel servers