Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case

This paper considers a scheduling problem that has both precedence constraints (of a general form as in PERT-CPM problems) and resource constraints (of the form in the general job-shop scheduling problem), and gives an efficient enumerative procedure for generating all active schedules for this problem. Based on this enumerative scheme, the paper describes a branch-and-bound method for implicitly enumerating all schedules and determining the optimum; finally, it gives computational experience for the problem where the objective is minimizing the project makespan.