Resource leveling algorithm based on integer programming in LSM

The Resource leveling problem in linear projects is one of the most important problems in project management scheduling. In this paper a new method for identifying controlling path in linear project scheduling is proposed, on the basis of which an algorithm for resource leveling in linear projects is presented. The algorithm is based on the integer programming. It keeps the controlling activities unchanged in resource usage and changes the resource quantity of non-controlling activities. For convenience of project management, the resource usage for each activity could be only changed once. An illustrative example shows that the resource leveling algorithm presented in this paper is better than the existed algorithms.