Contributions to the theory of optimal resource allocation

Publisher Website
Google Scholar
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.

This publication has 3 references indexed in Scilit: