IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v10y1963i1p175-191.html
   My bibliography  Save this article

Optimum allocation of a spares budget

Author

Listed:
  • M. Blitz
  • Wnltham

Abstract

An algorithm is derived for allocating finite resources in discrete amounts to a number of activities subject to a set of nonlinear constraints. The algorithm differs from those previously described in that the amount of the resource consumed for an additional unit of any one activity need not be constant. The algorithm is then applied to the problem of allocating a spares budget when repair of failed subsystems is allowed and the cost of unit subsystems is a function of the number to be spared. Two models are presented: one with an unrestricted repair facility, exponential failure distributions, and general repair distributions; and another with more limited repair and exponential failure and repair distributions.

Suggested Citation

  • M. Blitz & Wnltham, 1963. "Optimum allocation of a spares budget," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 10(1), pages 175-191, March.
    • Handle: RePEc:wly:navlog:v:10:y:1963:i:1:p:175-191
    DOI: 10.1002/nav.3800100114
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800100114
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800100114?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
    ---><---

    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:wly:navlog:v:10:y:1963:i:1:p:175-191. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.