Resource Leveling of Linear Schedules Using Integer Linear Programming

Abstract

Since the early 1960s many techniques have been developed to plan and schedule linear construction projects. However, one, the critical path method (CPM), overshadowed the others. As a result, CPM developed into the powerful and effective tool that it is today. However, research has indicated that CPM is ineffective for linear construction. Linear construction projects are typified by activities that must be repeated in different locations such as highways, pipelines, and tunnels. Recently, there has been renewed interest in linear scheduling. Much of this interest has involved a technique called the linear scheduling method (LSM). Only recently has there been the ability to calculate the controlling activities of a linear schedule, independent of network analysis. Additional research needs to be done to develop some of the techniques available in CPM into comparable ones for linear scheduling. One of these techniques is resource leveling. This paper uses the vehicle of a highway construction project to present an integer linear programming formulation to level the resources of linear projects.