Optimum Checking Schedules for Systems Subject to Random Failure

Joseph B. Keller
Additional contact information
Joseph B. Keller: Courant Institute of Mathematical Sciences, New York University

Management Science, 1974, vol. 21, issue 3, 256-260

Abstract: An optimum checking schedule is one that minimizes the expected cost, which is the sum of the cost of checking and the expected loss due to an undetected failure. The problem is made tractable by supposing that checking is so frequent that it can be described by a continuous density n(t) of checks per unit time. The optimum n(t) is found by the methods of the calculus of variations. An explicit result is given when the loss is proportional to the duration of an undetected failure. A minimax solution is also given for the case in which the probability of failure is not known.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.21.3.256 (application/pdf)

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:inm:ormnsc:v:21:y:1974:i:3:p:256-260

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().