An efficient heuristic for a partially observable Markov decision process of machine replacement

DOI10.1016/S0305-0548(96)00043-3zbMath0890.90075OpenAlexW2170292236MaRDI QIDQ1373890

Israel David, Sigal Biran, Zilla Sinuany-Stern

Publication date: 25 November 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(96)00043-3

zbMATH Keywords

heuristicmachine-replacementreal-life partially observable Markov decision processes

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Markov and semi-Markov decision processes (90C40)

Related Items

A Multi-Stage Two-Machines Replacement Strategy Using Mixture Models, Bayesian Inference, and Stochastic Dynamic Programming ⋮ A simple suboptimal algorithm for system maintance under partial observability ⋮ Selecting a quality control attribute sample: An information-economics method

Cites Work

• Dynamic programming and stochastic control
• A survey of solution techniques for the partially observed Markov decision process
• Finite state Markovian decision processes
• A survey of algorithmic methods for partially observed Markov decision processes
• State of the Art—A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms
• Computationally Feasible Bounds for Partially Observed Markov Decision Processes
• The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs
• Optimal control-limit strategies for a partially observed replacement problem†
• The Optimal Control of Partially Observable Markov Processes over a Finite Horizon
• Computation and Structure of Optimal Reset Policies