IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v7y1959i4p468-477.html
   My bibliography  Save this article

An Optimum Policy for Detecting a Fault in a Complex System

Author

Listed:
  • Brian Gluss

    (Armour Research, Foundation of Illinois Institute of Technology, Chicago, Illinois)

Abstract

Consider a complex system consisting of N modules containing n (1), ..., n ( N ) items or sub-circuits. A very simple device of this nature, for example, would be a hi-fi set, where the amplifier, the cartridge, the speaker(s) and the turntable could be considered to be the modules, and the various parts of each as the basic items in which faults could occur. A more realistic application of the results obtained might be to a radar-missile system, in which surveillance radar, tracking radar, communications system, computer, missile launcher and missile, or parts of them, represent the modules. When the system breaks down, the procedure for detecting the breakdown and hence repairing the system will determine the time taken to repair it. Assuming two different possible models, equations are developed for the optimum policy, i.e., the policy which minimizes the expected amount of time consumed or penalties paid, and these equations are solved for the first model. Model I assumes that over-all tests of each module may be performed, and individual item tests within modules, model II assumes that over-all module tests are not possible, and that penalty costs must be paid whenever the search moves from one module to another. In both models, penalty costs---in time, for example---are associated with the testing of each item and module.

Suggested Citation

  • Brian Gluss, 1959. "An Optimum Policy for Detecting a Fault in a Complex System," Operations Research, INFORMS, vol. 7(4), pages 468-477, August.
  • Handle: RePEc:inm:oropre:v:7:y:1959:i:4:p:468-477
    DOI: 10.1287/opre.7.4.468
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.7.4.468
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.7.4.468?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Robbert Fokkink & Thomas Lidbetter & László A. Végh, 2019. "On Submodular Search and Machine Scheduling," Management Science, INFORMS, vol. 44(4), pages 1431-1449, November.
    2. Stanley J. Benkoski & Michael G. Monticino & James R. Weisinger, 1991. "A survey of the search theory literature," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 469-494, August.
    3. Daoud Aït-Kadi & Zineb Simeu-Abazi & Ahmed Arous, 2018. "Fault isolation by test scheduling for embedded systems using a probabilistic approach," Journal of Intelligent Manufacturing, Springer, vol. 29(3), pages 641-649, March.
    4. Rostami, Salim & Creemers, Stefan & Wei, Wenchao & Leus, Roel, 2019. "Sequential testing of n-out-of-n systems: Precedence theorems and exact methods," European Journal of Operational Research, Elsevier, vol. 274(3), pages 876-885.
    5. Agnetis, Alessandro & Hermans, Ben & Leus, Roel & Rostami, Salim, 2022. "Time-critical testing and search problems," European Journal of Operational Research, Elsevier, vol. 296(2), pages 440-452.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:7:y:1959:i:4:p:468-477. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.