Abstract

This study introduces an iterative scheduling method that combines two approaches for managing repetitive construction projects: the Critical Path Method (CPM) and the Repetitive Scheduling Method (RSM). The primary objective of this study is to demonstrate how optimization techniques can be applied to minimize the cost of construction projects within a defined range, spanning from the shortest to the longest possible project durations. In the shortest project duration (as determined by CPM), all activities are allocated idle times based on precedence constraints, while in the longest duration (as determined by RSM), there is no idle time allocated. To calculate the optimal schedule, a computerized iterative method specifically designed for this purpose considers all possible combinations of activities with and without idle time. The optimum schedule is the one that minimizes the total project cost. The study reveals that by using an Excel spreadsheet, it is feasible to deterministically optimize the cost of repetitive construction projects, achieving the minimum cost. This minimization process can also be implemented as a Python application. Notably, this proposed system provides multiple optimal solutions, enabling managers to select the most suitable one. This advantage distin-guishes it from conventional methods, such as genetic algorithms and other optimization techniques. However, there are some limitations when applying this application, one of which is the maximum capacity available to run the application.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call