General dynamic programming algorithms applied to polling systems
From MaRDI portal
Publication:4221685
Recommendations
Cited in
(5)- Optimal inventory replenishment policy for a queueing system with finite waiting room capacity
- ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS
- A strongly polynomial algorithm for controlled queues
- Dispatching to parallel servers. Solutions of Poisson's equation for first-policy improvement
- Mathematical methods to study the polling systems
This page was built for publication: General dynamic programming algorithms applied to polling systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4221685)