Optimization of polling systems with Bernoulli schedules
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 19790
- The impact of scheduling policies on the waiting-time distributions in polling systems
- scientific article; zbMATH DE number 1285792
- scientific article; zbMATH DE number 977757
- Efficient visit orders for polling systems
- Stochastic bounds for a polling system
- Asymptotic optimality of the binomial-exhaustive policy for polling systems with large switchover times
- On optimal polling policies
Cited in
(16)- Ordinal optimization of \(G/G/1/K\) polling systems with \(k\)-limited service discipline
- Average waiting time of a symmetric polling system under Bernoulli scheduling
- On optimal polling policies
- Multicycle polling scheduling algorithms for FieldBus networks
- Polling: past, present, and perspective
- Polling models with multi-phase gated service
- A Taylor series approach for service-coupled queueing systems with intermediate load
- Light-traffic analysis of random access systems without collisions
- A 2-class maintenance model with dynamic server behavior
- Mathematical methods to study the polling systems
- Analysis of a time-limited service priority queueing system with exponential timer and server vacations
- Cyclic Bernoulli polling
- Tandem queues with impatient customers for blood screening procedures
- scientific article; zbMATH DE number 19790 (Why is no real title available?)
- scientific article; zbMATH DE number 1285792 (Why is no real title available?)
- The Power-Series Algorithm for Polling Systems with Time Limits
This page was built for publication: Optimization of polling systems with Bernoulli schedules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3122601)