scientific article; zbMATH DE number 977757

zbMATH Open0867.90056MaRDI QIDQ4331901FDOQ4331901

Authors: Mark P. Van Oyen, Demosthenis Teneketzis 

Publication date: 4 August 1997

Title of this publication is not available (Why is that?)

Recommendations

• On optimal polling policies
• scientific article; zbMATH DE number 19794
• Dynamic visit-order rules for batch-service polling
• Polling systems with batch service

zbMATH Keywords

optimal scheduling\(N\)-node ring queueing networkinfinite-capacity batch serveroptimality and monotonicity of threshold scheduling policies

Mathematics Subject Classification ID

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

Cited In (8)

• Mathematical methods to study the polling systems
• Ordinal optimization of \(G/G/1/K\) polling systems with \(k\)-limited service discipline
• THE ISRAELI QUEUE WITH INFINITE NUMBER OF GROUPS
• Optimization of polling systems with Bernoulli schedules
• Polling systems with batch service
• The Israeli queue with retrials
• The Israeli queue with a general group-joining policy
• Dynamic visit-order rules for batch-service polling

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4331901)