Stochastic Allocation Rules

Saligrama Agnihothri, Uday S. Karmarkar and Peter Kubat
Additional contact information
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

Operations Research, 1982, vol. 30, issue 3, 545-555

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.

Keywords: 331 stochastic allocation; 362; allocation rules (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.30.3.545 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:30:y:1982:i:3:p:545-555

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().