Multiple Allocation Of Resources In A Network An Optimal Scheduling Algorithm*

Abstract

This paper presents an optimal algorithm for scheduling a project network when the tasks are operating in a resource pool which has a finite upper bound on each resource type. A state space description of task processing time is used in the dynamic programming formulation. A finite time processing interval and a penalty cost rate ia assigned to each task to cost the system in the optimal search.