Research Abstract on a Feasibility Approach to Optimal Schedules

Optimization algorithms capable of efficiently solving general large scale resource scheduling problems do not exist. There are some specially structured scheduling problems for which optimization algorithms are available; for examples, see Johnson (3), Hu (2), and Chaudhuri (1). A slight extension of the problem discussed by Hu is presented here. First, a portion of Hu’s presentation in reference (2) will be discussed. The problem of interest which was solved in (2) had as its objective to minimize schedule duration under the following assumptions: (1) the project network diagram is a tree, (a tree is a graph containing no closed loops), (2) each activity requires unit time and a single resource common to each activity, (3) resources are available in integral numbers.