An exact solution for the resource-constrained construction scheduling problem

    Bartłomiej Sroka Affiliation
    ; Elżbieta Radziszewska-Zielina Affiliation


Reduced time and, by the same token, the cost of the project is a crucial factor in contemporary construction. This article presents a method for the exact optimisation of a resource-constrained scheduling problem. Based on the Critical Path Method, graph theory and linear programming, an algorithm was developed and the FROPT program was written in Matlab to minimise the execution time of the task. By using the newly-created program, sample networks were calculated and the results were compared with results obtained by using the MS Project scheduling program (using approximation algorithm). The execution time obtained by using FROPT were on average 10% shorter than those obtained using MS Project. In selected cases the improvement in execution time reached 25%. A deterministic approach to the problem may shorten planned project times and bring financial benefits. Due to the exponential complexity of the algorithm, it is most useful in solving small or highly coherent networks. The algorithm and program may result in benefits not offered by commercial software for planners of building projects.

Keyword : RCPSP, CPM, linear programming, MS Project, graph theory, project scheduling

How to Cite
Sroka, B., & Radziszewska-Zielina, E. (2016). An exact solution for the resource-constrained construction scheduling problem. Engineering Structures and Technologies, 8(2), 71-78.
Published in Issue
Jul 7, 2016
Abstract Views
PDF Downloads
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.