Dynamic priority rules for cyclic-type queues

DOI10.2307/1427168zbMath0672.60092OpenAlexW2027409941MaRDI QIDQ3825894

Sid Browne, Uri Yechiali

Publication date: 1989

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1427168

zbMATH Keywords

schedulingpolling systemsoptimization problemdynamic controlqueues in cyclic order

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (18)

Polling: past, present, and perspective ⋮ Approximating queue size and waiting time distributions in general polling systems ⋮ Fair allocation of personal protective equipment to health centers during early phases of a pandemic ⋮ Considerations of single-machine scheduling with deteriorating jobs ⋮ Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time ⋮ An Overview for Markov Decision Processes in Queues and Networks ⋮ A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights ⋮ On global near optimality of special periodic protocols for fluid polling systems with setups ⋮ On optimal polling policies ⋮ Cyclic reservation schemes for efficient operation of multiple-queue single-server systems ⋮ Dynamic priority rules when polling with multiple parallel servers ⋮ Performance analysis and optimization of a cyclic-service tandem queueing system with multi-class customers ⋮ Fluid polling systems ⋮ Workloads and waiting times in single-server systems with multiple customer classes ⋮ A polling system with `join the shortest -- serve the longest' policy ⋮ On fairness in polling systems ⋮ Cyclic Bernoulli polling ⋮ Pseudo-cyclic policies for multi-queue single server systems

This page was built for publication: Dynamic priority rules for cyclic-type queues