An Enhanced RCS Heuristic and an Enhanced RCPM Algorithm to Perform Delay Analysis in Schedules without Phantom Float
Autor: | Franco Duran, Diana Marcela |
---|---|
Rok vydání: | 2020 |
Předmět: | |
Druh dokumentu: | Dissertation |
Popis: | On a regular basis, project managers concentrate their efforts on critical and near-critical activities. However, the concepts of total float and critical path lose their significance after applying resource-constrained scheduling (RCS) methodologies. RCS techniques solve the resource conflicts but create phantom float in the schedules (i.e., a float that does not exist). RCS techniques overlook the resources relationships between activities that compete for the same but unavailable resources. Therefore, each time an activity uses this apparent float (phantom float), there is a resource violation in the schedule. Due to the projects' size and complexity, schedulers use scheduling software such as Primavera P6 to fix the resource conflicts of a schedule. The software correctly determines the activities' earliest dates that satisfy the resource limitations, but they calculate total float based on a "Time Context" ignoring the presence of resource constraints. Thus, the results show incorrect total float values and a broken critical path. The lack of a continuous critical path makes impossible the anticipation of the impact of a delaying event in the project completion time. Several algorithms have been developed to address the shortcomings of RCS methods. These RCS related algorithms were developed with the aim of providing project managers a tool to correctly schedule and identify critical activities with respect to time and resource allocation and correctly calculate the total float of each activity under resource constraints. In this regard, the Resource-Constrained Critical Path Method (RCPM) is an algorithm that correctly calculates the floats of activities and identifies a continuous critical path in resource-constrained schedules. Regardless of the RCPM provides more reliable float values than traditional RCS-related algorithms, there are some shortcomings that must be addressed to enhance its capability. This study addresses the existing shortcomings of RCPM to make it more practical for real construction projects. Doctor of Philosophy One of the challenges of resource allocation is resource availability because oftentimes, the resource demand exceeds the supply. When resources are over-allocated, activities are delayed until resources become available. Due to the projects' size and complexity, schedulers use available software to solve the resource conflicts of a schedule. After testing Primavera P6 versions and MS Project v2016, both software create phantom float in a resource-constrained schedule. This is, the RCS calculations suggest that activities have float, but this float might not exist at all. Resource-Constrained Scheduling (RCS) techniques mitigate a resource supply-demand problem but fail to identify a project critical path. The methods do not consider the resource-activity dependencies that arise when activities are delayed due to resource limits. As a result, the critical path is broken, and all the activities must be considered as critical. To provide correct float values and a continuous critical path, the Resource-Constrained Critical Path (RCPM) was introduced by Kim and de la Garza in 2003. Regardless of the RCPM provides more reliable float values than traditional RCS-related algorithms, there are some shortcomings that must be addressed to enhance its capability. This study addresses the existing shortcomings of RCPM to make it more practical for real construction projects. |
Databáze: | Networked Digital Library of Theses & Dissertations |
Externí odkaz: |