Dynamic priority rules when polling with multiple parallel servers

Authors:
Sid Browne;Gideon Weiss
Affiliations:
Columbia University, New York, NY, USA;Georgia Institute of Technology, Atlanta, GA, USA
Venue:
Operations Research Letters
Year:
1992

Citing 4
Cited 0

Analysis of polling systems

Analysis of polling systems
Optimal dynamic operating policies for cyclic-type queues

Optimal dynamic operating policies for cyclic-type queues
Scheduling deteriorating jobs on a single processor

Operations Research
Workloads and waiting times in single-server systems with multiple customer classes

Proceedings of the workshop held at the Mathematical Sciences Institute Cornell University on Mathematical theory of queueing systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we extend previous results (by Browne and Yechiali) on dynamic priority rules in polling systems to a new version of a polling system where a number of servers c are coupled together as they service the stations. Index rules are derived to optimize system performance.