Efficient visit orders for polling systems
From MaRDI portal
Recommendations
Cited in
(14)- Efficient visit frequencies for polling tables: Minimization of waiting cost
- Cyclic reservation schemes for efficient operation of multiple-queue single-server systems
- Performance analysis and optimization of a cyclic-service tandem queueing system with multi-class customers
- Optimization of template-driven scheduling mechanisms: Regularity measures and computational techniques
- Polling: past, present, and perspective
- Fluid polling systems
- Mathematical methods to study the polling systems
- A pseudoconservation law for a time-limited service polling system with structured batch Poisson arrivals
- Dynamic visit-order rules for batch-service polling
- Optimization of polling systems with Bernoulli schedules
- Quasi-fixed cyclic production schemes for multiple products with stochastic demand
- A Marginal Productivity Index Rule for Scheduling Multiclass Queues with Setups
- On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing
- On competitive analysis for polling systems
This page was built for publication: Efficient visit orders for polling systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4272460)