optimization-based scheduling of construction projects with generalized precedence relationships: a real-life case study

Concomitant reduction of cost and duration is recognized as one of the main aspects of construction planning. expedition of project schedule naturally incurs extra costs due to implementation of more productive and/or high-price construction techniques. meanwhile, a reduction in time is usually plausible only down to a certain limit, below which renders expeditions either technically or financially unviable. thus, striking a reasonable balance between project cost and duration remains a desirable yet challenging task for which there has been a myriad of advancements and literature. despite the many studies associated with this problem – referred to as time-cost trade-off problem (tctp) – it is observed that only a few exercise tctps with generalized logical relationships. this observation holds despite the fact that generalized precedence relationships are imperative to introduce parallelism and to secure a realistic overlap among the activities. in this regard, a simulated annealing-based genetic algorithm as proposed herein, is specifically designed to provide the capability of exerting tctps with properly overlapped activities. efficiency of this algorithm is tested over a wide range of problems and its performance is validated over a large-scale real-case construction project. results of the hybridized ga indicate fast and robust convergence to high-quality solutions.