Login | Register

Optimized Resource-Constrained Method for Project Schedule Compression

Title:

Optimized Resource-Constrained Method for Project Schedule Compression

Elkabalawy, Moaaz ORCID: https://orcid.org/0000-0001-6654-2281 (2020) Optimized Resource-Constrained Method for Project Schedule Compression. Masters thesis, Concordia University.

[thumbnail of Elkabalawy_MSc_S2021.pdf]
Preview
Text (application/pdf)
Elkabalawy_MSc_S2021.pdf - Accepted Version
Available under License Spectrum Terms of Access.
1MB

Abstract

Construction projects are unique and can be executed in an accelerated manner to meet market conditions. Accordingly, contractors need to compress project durations to meet client changing needs and related contractual obligations and recover from delays experienced during project execution. This acceleration requires resource planning techniques such as resource leveling and allocation. Various optimization methods have been proposed for the resource-constrained schedule compression and resource allocation and leveling individually. However, in real-world construction projects, contractors need to consider these aspects concurrently.
For this purpose, this study proposes an integrated method that allows for joint consideration of the above two aspects. The method aims to optimize project duration and costs through the resources and cost of the execution modes assigned to project activities. It accounts for project cost and resource-leveling based on costs and resources imbedded in these modes of execution. The method's objective is to minimize the project duration and cost, including direct cost, indirect cost, and delay penalty, and strike a balance between the cost of acquiring and releasing resources on the one hand and the cost of activity splitting on the other hand.
The novelty of the proposed method lies in its capacity to consider resource planning and project scheduling under uncertainty simultaneously while accounting for activity splitting. The proposed method utilizes the fuzzy set theory (FSs) for modeling uncertainty associated with the duration and cost of project activities and genetic algorithm (GA) for scheduling optimization. The method has five main modules that support two different optimization methods: modeling uncertainty and defuzzification module; scheduling module; cost calculations module; sensitivity
IV
analysis module; and decision-support module. The two optimization methods use the genetic algorithm as an optimization engine to find a set of non-dominated solutions. One optimization method uses the elitist non-dominated sorting genetic algorithm (NSGA-II), while the other uses a dynamic weighted optimization genetic algorithm. The developed scheduling and optimization method is coded in python as a stand-alone automated computerized tool to facilitate the needed iterative rescheduling of project activities and project schedule optimization.
The developed method is applied to a numerical example to demonstrate its use and to illustrate its capabilities. Since the adopted numerical example is not a resource-constrained optimization example, the proposed optimization methods are validated through a multi-layered comparative analysis that involves performance evaluation, statistical comparisons, and performance stability evaluation. The performance evaluation results demonstrated the superiority of the NSGA-II against the dynamic weighted optimization genetic algorithm in finding better solutions. Moreover, statistical comparisons, which considered solutions’ mean, and best values, revealed that both optimization methods could solve the multi-objective time-cost optimization problem. However, the solutions’ range values indicated that the NSGA-II was better in exploring the search space before converging to a global optimum; NSGA-II had a trade-off between exploration (exploring the new search space) and exploitation (using already detected points to search the optimum). Finally, the coefficient of variation test revealed that the NSGA-II performance was more stable than that of the dynamic weighted optimization genetic algorithm.
It is expected that the developed method can assist contractors in preparation for efficient schedule compression, which optimizes schedule and ensures efficient utilization of their resources.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Building, Civil and Environmental Engineering
Item Type:Thesis (Masters)
Authors:Elkabalawy, Moaaz
Institution:Concordia University
Degree Name:M.A. Sc.
Program:Civil Engineering
Date:13 October 2020
Thesis Supervisor(s):Moselhi, Osama
Keywords:Schedule optimization, Resource-constrained scheduling under uncertainty, NSGA-II, Fuzzy set theory.
ID Code:987623
Deposited By: Moaaz Aly Aly Elkabalawy
Deposited On:23 Jun 2021 16:27
Last Modified:23 Jun 2021 16:27
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Research related to the current document (at the CORE website)
- Research related to the current document (at the CORE website)
Back to top Back to top