IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v29y2012i03ns0217595912400179.html
   My bibliography  Save this article

Adaptive Resource Allocation To Maximize Run-Out Times

Author

Listed:
  • ALAN LEE

    (Department of Statistics, The University of Auckland, Auckland, New Zealand)

  • ILZE ZIEDINS

    (Department of Statistics, The University of Auckland, Auckland, New Zealand)

Abstract

We introduce a method for maximizing the run-out time for a system where the number of components available to make repairs is finite, and some of the components may be substituted for one another. The objective is to maximize the time at which the earliest run-out of any component occurs. The approach proposed here is to find the minimum time horizon such that no feasible allocation exists for a related linear programming problem. An adaptive version of this algorithm is proposed as a heuristic for the stochastic problem.

Suggested Citation

  • Alan Lee & Ilze Ziedins, 2012. "Adaptive Resource Allocation To Maximize Run-Out Times," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 29(03), pages 1-11.
    • Handle: RePEc:wsi:apjorx:v:29:y:2012:i:03:n:s0217595912400179
    DOI: 10.1142/S0217595912400179
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595912400179
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595912400179?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:wsi:apjorx:v:29:y:2012:i:03:n:s0217595912400179. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.