Key points are not available for this paper at this time.
Abstract This paper focuses upon the problem of assigning feasible start times to a set of activities making up a project, static job shop, or static flowship type schedules under two constraint sets: (1) no activity may be started until all activities technologically established as its predecessor set have been completed, and (2) the total resource requirements of all activities in process at any time in the schedule must not exceed the level of availability for each of the multiple resource classes. The solution procedure used for these problems is branch and bound, and the resulting complete schedules are optimized with an objective of minimizing the completion time of the entire set of activities. Computational results on tests conducted on a number of randomly generated problem sets with up to 60 activities and six resource classes are presented.
Stinson et al. (Fri,) studied this question.