Optimal resource leveling using implicit enumeration

This paper presents a new exact approach for resource leveling based on implicit enumeration. The objective of the proposed approach is to schedule all the activities in the project to specific time periods within their float, such that the resource histograms meet the desired concave shape. The model, which is applied to an activity-on-node network, requires as input the scheduling results computed by the critical path method. Computational results indicate that the procedure provides exact solutions for small to medium size problems, requiring only modest computing facilities.