Lower Bound Methods

Abstract

In this chapter, methods for computing lower bounds on the smallest possible project completion time of a project which has to be scheduled under resource constraints are described. The purpose behind developing such methods is twofold. If heuristic procedures as described in Chapter 5 are applied for determining a feasible solution, the size of the gap between a computed lower bound value and the project completion time associated with the determined solution can be computed. This may provide a measure for judging whether investing additional planning effort in order to determine an improved solution is justified or not. In case of using exact procedures such as described in Chapter 6, according methods can be incorporated into the procedures in order to reduce the solution effort required.