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

Stochastic Allocation Rules

Author

Listed:
  • Saligrama Agnihothri

    (University of Rochester, Rochester, New York)

  • Uday S. Karmarkar

    (University of Rochester, Rochester, New York)

  • Peter Kubat

    (University of Rochester, Rochester, New York)

Abstract

This paper considers the allocation of a fixed amount of resource across competing activities, where the rate of use of the allocated amounts is stochastic. The allocated amounts are said to have run out when the first of the allocations is used up and another distribution must then be considered. This problem arises in the allocation of stocks of a commodity to branch warehouses and in the allocation of production time to items that are jointly produced. It also occurs in the allocation of spares to subsystems when the total number of spares is constrained by volume or cost and when failure of one subsystem causes a failure of the whole system. Two alternative formulations are presented: the Maximization of Expected Time to Runout and the Minimization of Expected Discounted Time to Runout. Bounds are developed on the problems by using deterministic and exponential models for the time to runout. The case of two competing processes is investigated numerically, and it appears that the solutions to the bounding problems provide effective heuristics at least for such small problems.

Suggested Citation

  • Saligrama Agnihothri & Uday S. Karmarkar & Peter Kubat, 1982. "Stochastic Allocation Rules," Operations Research, INFORMS, vol. 30(3), pages 545-555, June.
    • Handle: RePEc:inm:oropre:v:30:y:1982:i:3:p:545-555
    DOI: 10.1287/opre.30.3.545
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.30.3.545
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.30.3.545?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. Hanan Luss, 1999. "On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach," Operations Research, INFORMS, vol. 47(3), pages 361-378, June.

    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:30:y:1982:i:3:p:545-555. 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.