A Bayesian Dynamic Programming approach tooptimal maintenance combined with burn‐in

E. Nicolato and W.J. Runggaldier

Annals of Operations Research, 1999, vol. 91, issue 0, 105-122

Abstract: We consider a complex system consisting of N identical components that are expected tofunction properly during a given period (mission time). Due to the possibility of failurebefore completion of the mission time, one allows for maintenance as well as burn‐in, thelatter in order to cope with the problem of “infant mortality”. We present a two‐level (Bayesian)Dynamic Programming approach to determine the optimal timing of the maintenance interventionsand durations of burn‐in, including maintenance‐induced burn‐in. We also discussways to reduce the “curse of dimensionality”. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018933319826 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:91:y:1999:i:0:p:105-122:10.1023/a:1018933319826

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018933319826

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().