Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-26T20:31:25.362Z Has data issue: false hasContentIssue false
  • English
  • Français

Contributions to the theory of optimal resource allocation

Published online by Cambridge University Press:  14 July 2016

E. Laska ,
M. Meisner  and
C. Siegel
E. Laska
Affiliation:
Rockland State Hospital, Orangeburg, New York
M. Meisner
Affiliation:
Rockland State Hospital, Orangeburg, New York
C. Siegel
Affiliation:
Rockland State Hospital, Orangeburg, New York
Get access Rights & Permissions [Opens in a new window]

Abstract

A problem in optimal resource allocation is considered for n jobs with identically distributed service times admitting a monotone hazard function. If the hazard function is increasing, it is shown that the procedure of allocating the full resource individually to each job until its completion minimizes the expected completion time of the jth job. The procedure which at any instant of time equally allocated the resource among all of the remaining jobs is shown to minimize the expected total cumulative waiting time if the hazard is decreasing.

Keywords

ALLOCATION FUNCTIONSOPTIMAL RESOURCE ALLOCATIONHAZARD FUNCTIONSTIME SHARING
Type
Research Papers
Information
Journal of Applied Probability , Volume 9 , Issue 2 , June 1972 , pp. 337 - 359
Copyright
Copyright © Applied Probability Trust 1972 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Barlow, R. E. and Proschan, F. (1965) Mathematical Theory of Reliability. John Wiley and Sons, Inc., New York.Google Scholar
[2] Gittins, J. C. (1969) Optimal resource allocation in chemical research Adv. Appl. Prob. 1, 238–270.CrossRefGoogle Scholar
[3] Grows, J. C. (1972) Some problems of stochastic resource allocation. J. Appl. Prob. 9, 360–369.Google Scholar
[4] Mckinney, J. M. (1969) A survey of analytical time-sharing models. Computing Surveys 1, 105–116.CrossRefGoogle Scholar