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

Optimization of Series-Parallel-Series Networks

Author

Listed:
  • Paul A. Jensen

    (University of Texas, Austin, Texas)

Abstract

This paper introduces a generalization of the frequently discussed problem of finding the optimum redundancy that maximizes the reliability of a network of components. Past work has restricted consideration to arrangements of redundant components called series-parallel networks. This paper allows a much broader class of arrangements called series-parallel-series networks. It is important to consider such arrangements for realistic situations in which components have more than one failure mode, or the combination of parallel paths introduces a failure probability. A dynamic programming algorithm is used to solve the more general problem for the case in which there are no constraints on the optimum solution. The algorithm is extended to handle multiple constraints using dominance and a variety of elimination methods to reduce the storage required in a computer implementation of the algorithm. Problems with as many as 15 serial components and three constraints have been solved with reasonable digital computer computation times.

Suggested Citation

  • Paul A. Jensen, 1970. "Optimization of Series-Parallel-Series Networks," Operations Research, INFORMS, vol. 18(3), pages 471-482, June.
    • Handle: RePEc:inm:oropre:v:18:y:1970:i:3:p:471-482
    DOI: 10.1287/opre.18.3.471
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.18.3.471
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.18.3.471?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. Yalaoui, Alice & Chu, Chengbin & Châtelet, Eric, 2005. "Reliability allocation problem in a series–parallel system," Reliability Engineering and System Safety, Elsevier, vol. 90(1), pages 55-61.
    2. M Bachlaus & N Shukla & M. K. Tiwari & R Shankar, 2006. "Optimization of system reliability using chaos-embedded self-organizing hierarchical particle swarm optimization," Journal of Risk and Reliability, , vol. 220(2), pages 77-91, December.

    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:18:y:1970:i:3:p:471-482. 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.