Project Scheduling with Time Windows and Scarce Resources III: Active, Semiactive, Pseudoactive and Quasiactive Schedules Are Minimal Points of the Feasible RegionTextbook
Exact and heuristic methods for resource-constrained project scheduling do not search the whole continuum of start-time vectors. They enumerate a finite candidate set that is guaranteed to contain an optimal schedule. For machine scheduling and precedence-only project scheduling the classical candidate sets (semiactive and active schedules) are defined by…