Project scheduling under partially renewable resource constraints

A generalization of the classical resource constrained project scheduling problem is considered. Partially renewable resources are introduced by assuming for each resource a capacity on subsets of periods. For the exact solution of the problem, a basic enumeration scheme is used. Bounds are formulated to speed convergence. Further, the serial scheduling scheme is generalized in order to get fast approximation methods. Finally, these methods are assessed by solving ProGen instances generated under a full factorial test design.