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

Dynamic Programming and the Reliability of Multicomponent Devices

Author

Listed:
  • Richard Bellman

    (The Band Corporation, Santa Monica, California)

  • Stuart Dreyfus

    (The Band Corporation, Santa Monica, California)

Abstract

In this paper it is shown how the functional equation technique of dynamic programming may be used to treat a class of problems that arise in the construction of multicomponent devices. We are interested in determining the types of components and the quantities that should be used in order to construct the most reliable device possible subject to given cost and weight constraints. A numerical example is given

Suggested Citation

  • Richard Bellman & Stuart Dreyfus, 1958. "Dynamic Programming and the Reliability of Multicomponent Devices," Operations Research, INFORMS, vol. 6(2), pages 200-206, April.
    • Handle: RePEc:inm:oropre:v:6:y:1958:i:2:p:200-206
    DOI: 10.1287/opre.6.2.200
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.6.2.200
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.6.2.200?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. Young Woong Park, 2020. "MILP Models for Complex System Reliability Redundancy Allocation with Mixed Components," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 600-619, July.
    2. Zhang, Enze & Wu, Yifei & Chen, Qingwei, 2014. "A practical approach for solving multi-objective reliability redundancy allocation problems using extended bare-bones particle swarm optimization," Reliability Engineering and System Safety, Elsevier, vol. 127(C), pages 65-76.
    3. Christopher Garcia, 2018. "Optimal multiunit transfer over adversarial paths with increasing intercept probabilities," IISE Transactions, Taylor & Francis Journals, vol. 50(11), pages 989-996, November.
    4. Nahas, Nabil & Nourelfath, Mustapha & Ait-Kadi, Daoud, 2007. "Coupling ant colony and the degraded ceiling algorithm for the redundancy allocation problem of series–parallel systems," Reliability Engineering and System Safety, Elsevier, vol. 92(2), pages 211-222.
    5. Anushri Maji & Asoke Kumar Bhunia & Shyamal Kumar Mondal, 2022. "A production-reliability-inventory model for a series-parallel system with mixed strategy considering shortage, warranty period, credit period in crisp and stochastic sense," OPSEARCH, Springer;Operational Research Society of India, vol. 59(3), pages 862-907, September.
    6. Coit, David W. & Zio, Enrico, 2019. "The evolution of system reliability optimization," Reliability Engineering and System Safety, Elsevier, vol. 192(C).
    7. Cao, Dingzhou & Murat, Alper & Chinnam, Ratna Babu, 2013. "Efficient exact optimization of multi-objective redundancy allocation problems in series-parallel systems," Reliability Engineering and System Safety, Elsevier, vol. 111(C), pages 154-163.
    8. Sunita Kumari & Pooja Khurana & Shakuntla Singla & Arun Kumar, 2022. "Solution of constrained problems using particle swarm optimiziation," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(4), pages 1688-1695, August.
    9. Liang, Yun-Chia & Chen, Yi-Ching, 2007. "Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm," Reliability Engineering and System Safety, Elsevier, vol. 92(3), pages 323-331.
    10. Sadan Kulturel-Konak & Bryan A. Norman & David W. Coit & Alice E. Smith, 2004. "Exploiting Tabu Search Memory in Constrained Problems," INFORMS Journal on Computing, INFORMS, vol. 16(3), pages 241-254, August.

    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:6:y:1958:i:2:p:200-206. 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.