A comparison of different clustering algorithms for the project time buffering problem
Fangfang, Cao Servranckx, Tom He, Zhengwen
Fangfang, Cao
Servranckx, Tom
He, Zhengwen
Publication Type
Journal article with impact factor
Editor
Supervisor
Publication Year
2025
Journal
Computers & Industrial Engineering
Book
Publication Volume
199
Publication Issue
January
Publication Begin page
Publication End page
Publication Number of pages
Collections
Abstract
This paper studies the decentralised time buffering problem (TBP) to absorb project risk by building sufficient buffers with the aim of obtaining a stable project schedule. First, the position of the buffers in the project network should be determined and, subsequently, each buffer must be optimally sized. We investigate different activity clustering methods (K-means, rank order, criticality-based and network clustering) to determine the ideal groups of activities to be clustered together and protected by an allocated buffer. The obtained clusters of activities are then inputted in a multi-population multi-factorial evolutionary algorithm (MPMFEA) for creating buffers based on the characteristics of the activities in each cluster. To the best of our knowledge, this is the first study to integrate existing clustering methods into a buffering algorithm in order to optimise the project stability. Previous studies hybridising both methods use a single clustering algorithm (e.g. K-means) that does not use the same information than the buffering algorithm or require more complex (simulation-based) buffering methods. The computational experiments on a large set of artificial instances validate the effectiveness of the proposed MPMFEA for solving the TBP, especially in combination with the network clustering method. Although the generic K-Means method is still considered a viable option for clustering, the more pragmatic clustering methods are more effective. We inform project managers that considering precedence relations between activities during clustering is crucial, but mimicking this behaviour in all clustering methods does not guarantee successful protection of their projects.
Research Projects
Organizational Units
Journal Issue
Keywords
Clustering, Project Scheduling, Time Buffering Problem, Multifactorial Evolutionary Algorithm