General dynamic programming algorithms applied to polling systems

DOI10.1080/15326349808807520MaRDI QIDQ4221685zbMATH OpenOpenAlexFDO

Authors Eungab Kim, Mark P. Van Oyen, Maria Rieders

Publication date 25 May 1999

Published in Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/15326349808807520

zbMATH Keywords

value iterationsingle servermodified policy iterationpolling systemsmulti-class queueing system

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Dynamic programming (90C39) Queueing theory (aspects of probability theory) (60K25) Markov and semi-Markov decision processes (90C40)

Recommendations

• A strongly polynomial algorithm for controlled queues
• scientific article; zbMATH DE number 19794
• scientific article; zbMATH DE number 1233798

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)