Computational Analysis of Linear and Repetitive Construction Project Schedules with Singularity Functions

Abstract

Scheduling is among the most important managerial functions for constructions projects. The traditional critical path method has conceptual shortcomings that limit its analytical depth. These issues are overcome by the linear scheduling method. Linear schedules are ideally suited for any project featuring one predominant dimension beyond time, whether geometric or repetitive. Temporal and spatial constraints can be applied and interferences can be identified. Implementation of linear schedules in practice is very limited due to the lack of a full analysis methodology akin to the critical path method. Previous studies limited themselves to only assuming sample activities with constant productivities. This paper introduces a new analytical method for linear schedules that uses singularity functions to describe all activities and their interrelationships. These functions are computationally desirable due to several advantageous mathematical properties. An example of a transportation project demonstrates the application of the new method. Possible future extensions are briefly noted.