Exact methods for the resource levelling problem

We present a project scheduling problem subject to general temporal constraints where the utilization of a set of renewable resources has to be smoothed over time. For solving the NP-hard optimization problem, we point out some important structural properties and introduce a new enumeration scheme. Combining this enumeration scheme with some branch-and-bound techniques, we propose an appropriate solution procedure for the project scheduling problem at hand. To outline the practical importance of resource levelling, we sketch exemplary the optimization of mid-term planning schedules with regard to the resource requirements of IT projects. Finally, we present results from a comprehensive computational study on problem instances of the well-known rlp_j10 and rlp_j20 test sets devised by Kolisch et al. (Benchmark Instances for Project Scheduling Problems, Kluwer, Boston, 1999).