A novel use of value iteration for deriving bounds for threshold and switching curve optimal policies
From MaRDI portal
Publication:3120095
DOI10.1002/NAV.21824zbMath1407.90112OpenAlexW2907115441MaRDI QIDQ3120095
Dwi Ertiningsih, Sandjai Bhulai, Flora M. Spieksma
Publication date: 1 March 2019
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.21824
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Cites Work
- Structural results for the control of queueing systems using event-based dynamic programming
- Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes
- Recurrence Conditions for Average and Blackwell Optimality in Denumerable State Markov Decision Chains
- Applying a New Device in the Optimization of Exponential Queuing Systems
- On the Relation Between Recurrence and Ergodicity Properties in Denumerable Markov Decision Chains
- Contraction Conditions for Average and α-Discount Optimality in Countable State Markov Games with Unbounded Rewards
- Monotonicity in Markov Reward and Decision Chains: Theory and Applications
This page was built for publication: A novel use of value iteration for deriving bounds for threshold and switching curve optimal policies
