论文信息 - Dynamic priority rules when polling with multiple parallel servers

Dynamic priority rules when polling with multiple parallel servers

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.

Gideon Weiss | Sid Browne

[1] Samuel Karlin,et al. A First Course on Stochastic Processes , 1968 .

[2] Sid Browne,et al. Scheduling Deteriorating Jobs on a Single Processor , 1990, Oper. Res..

[3] Onno J. Boxma,et al. Workloads and waiting times in single-server systems with multiple customer classes , 1989, Queueing Syst. Theory Appl..

[4] U. Yechiali,et al. Dynamic priority rules for cyclic-type queues , 1989, Advances in Applied Probability.

[5] Sidney Browne. Optimal dynamic operating policies for cyclic-type queues , 1988 .

[6] Michael N. Katehakis,et al. Optimal Repair Allocation in a Series System , 1984, Math. Oper. Res..

[7] Paul E. Wright,et al. GATED, EXHAUSTIVE, PARALLEL SERVICE , 1992 .

[8] Hideaki Takagi,et al. Application of Polling Models to Computer Networks , 1991, Comput. Networks ISDN Syst..

[9] Hideaki Takagi,et al. Analysis of polling systems , 1986 .