Critical Path Resource Scheduling Algorithm

Most early applications of the critical path method did not consider the resources required to complete each project activity. Recently, increased attention has been given to this problem, and several methods have been suggested for scheduling activities which compete for resources which are available in stated maximum amounts. An algorithm is presented for scheduling project activities in such a way that the activities are performed in proper sequence, the total resource availabilities are not exceeded, and the project duration is kept to a minimum. The method assumes that activity durations can vary depending upon the amounts of resources assigned to them. A numerical example, using a small, hypothetical project network, is given. Further computational experience with a network of several hundred activities is reported. A possible extension of the approach, to provide for evaluating the cost of any premium time labor used to reduce project duration, is suggested. It is concluded that approaches of the type given herein are valid and worthy of further investigation.