Dynamic Programming Approach to Resource Scheduling under Constraints,

One of the most difficult problems encountered by the activity planner is the scheduling of activities under constraints. Too frequently, the best arrangement of activities may violate a constraint on the amount of resource available. A solution to this problem is presented in the paper, treating the resource allocation problem as a one dimensional allocation dynamic programming problem. If the cost of each activity, the penalty for not completing an activity, and the budget constraints for each budget period are known, it is possible to allocate resources optimally subject to the constraints given. Because of the nature of the dynamic programming, the optimal solution is determined for each value of resource available. The restrictive assumptions are explained in detail and provision for implementation has been provided by an automated algorithm that will allocate resources optimally to any number of budget periods under any given constraints on resources. Author