Approximation and bounds in discrete event dynamic programming

DOI10.1109/TAC.1986.1104250MaRDI QIDQ3722292zbMATH OpenFDO

Authors Pierre L'Ecuyer, Alain Haurie

Publication date 1986

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.1986.1104250

zbMATH Keywords

dynamic programminggroup preventive replacement modelmultistage stochastic decision processvalue iteration technique

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Stochastic programming (90C15) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40) Optimal stochastic control (93E20)

Recommendations

• scientific article; zbMATH DE number 3871063
• Bounds for the approximation of dynamic programs
• Discrete Event Dynamic Programming with Simultaneous Events
• Two adaptively stepped monotone algorithms for solving discounted dynamic programming equations
• Perspectives of approximate dynamic programming

Cited in

(15)

• Approximations for optimal stopping of a piecewise-deterministic process
• Discretization procedures for adaptive Markov control processes
• Time scale decomposition in production planning for unreliable flexible manufacturing systems
• Adaptive differential dynamic programming for multiobjective optimal control
• Turnpike properties for a class of piecewise deterministic systems arising in manufacturing flow control
• scientific article; zbMATH DE number 4174799 (Why is no real title available?)
• Perspectives of approximate dynamic programming
• The Parameter Iteration Method in Dynamic Programming
• On Bounds for Dynamic Programs
• Bounds for the approximation of dynamic programs
• The Repair VS. Replacement problem: A stochastic control approach
• Discrete Event Dynamic Programming with Simultaneous Events
• Optimal Flow Control for Continuous‐time Scheduling in Flexible Manufacturing Systems
• Functional Estimation for a Multicomponent Age Replacement Model
• Efficient purchaser incentive when dealing with suppliers implementing continuous improvement plans

This page was built for publication: Approximation and bounds in discrete event dynamic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3722292)