A Resource Allocation Problem

Abstract

In this paper two sequencing problems are investigated that arise in the course of allocating one or more constrained resources to two or more tasks. The general problem considered is one of determining the optimal sequence of tasks and the optimal scheduling of resource usage where the objective is to minimize the time by which all tasks are completed. The fundamental solution technique utilized involves a combination of dynamic programming and combinatorial analysis techniques. In the single resource case the two problems are shown to be graphical “duals” of each other thereby allowing an iterative solution to the second problem.