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

Abstract

This paper treats the 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). Preemptive-resume without changeover times is allowed. An efficient procedure for enumerating all active schedules is given. For the objective of minimizing the project length, a branch-and-bound algorithm is developed by adding a bounding procedure to the enumerative scheme. Computational experience is given.