Concurrent Construction Scheduling Simulation Algorithm

Limited resources (budget, labor, machinery) have a significant toll on the roads' construction. The question of interest is: given variations of resources over a lengthy construction time, what would be the best construction scheduling plan, or how to optimize the Gantt chart while considering two highly challenging features (1) prerequisite conditions and (2) the interdependency of the benefit of the projects’ completions. We formulate it as a bilevel problem where the objective function is to minimize generalized costs and the lower level accounts for the drivers’ route choice. We employ a solution algorithm based on a supervised learning technique (a linear regression model of machine‐learning) and an integer programming problem and it is applied to the datasets of Winnipeg and Chicago. The regression model was found to be a tight approximation which resulted in an efficient algorithm (the CPU time is almost a linear function of the number of iterations). Moreover, the proposed methodology can render promising results (at least locally optimal solutions). This article is the first to formulate the Gantt chart using linear binary constraints and optimize it tailored to real‐life case studies.

show abstract

“…Similarly, Lim et al. () take the concurrent feature of a scheduling plan to accelerate a construction project.…”

Section: Literature Reviewmentioning

confidence: 99%

Optimization for Roads' Construction: Selection, Prioritization, and Scheduling

Bagloee

Sarvi

Patriksson

et al. 2018

Computer aided Civil Eng

View full text Add to dashboard Cite

show abstract

“…Other models have, for simplicity, assumed the probabilities can be added [39,49], or have used the longest average rework duration instead [50], but those simplifications are not correct.…”

Section: The Multi-predecessor Case and Cascade Of Overlapsmentioning

confidence: 99%

Modelling the boundaries of project fast-tracking

Ballesteros‐Pérez

2017

Automation in Construction

View full text Add to dashboard Cite

Fast-tracking a project involves carrying out sequential activities in parallel, partially overriding their original order of precedence, to reduce the overall project duration. The current predominant mathematical models of fast-tracking are based on the concepts of activity sensitivity, evolution, dependency and, sometimes, information exchange uncertainty, and aim to determine optimum activity overlaps. However, these models require some subjective inputs from the scheduler and most of them neglect the merge event bias.In this paper, a stochastic model for schedule fast-tracking is proposed. Relevant findings highlight the existence of a pseudo-physical barrier that suggests that the possibility of shortening a schedule by more than a quarter of its original duration is highly unlikely. The explicit non-linear relationship between cost and overlap has also been quantified for the first time. Finally, manual calculations using the new model are compared with results from a Genetic Algorithm through a case study.

show abstract

“…Throughout the analyzed literature, researchers have shown that the GPRs are needed to formulate “ real‐life constraints ” (Schwindt, ), and that fragmentation and overlapping of processes and activities is very effective in improving the estimation of the project makespan for the Unconstrained Project Scheduling Problem (PSP) (Valls et al., ; Ponz‐Tienda et al., ) and Constrained PSP (Quintanilla et al., ), as well as for fast‐tracking complex construction projects (Srour et al., ) by setting up overlapping activities (Lim et al., ). Preemption as a solution for the fragmentation has been widely studied in manufacturing and services environments.…”

Section: Literature Reviewmentioning

confidence: 99%

The Fuzzy Project Scheduling Problem with Minimal Generalized Precedence Relations

Ponz-Tienda

Pellicer

Marco

et al. 2015

Computer aided Civil Eng

View full text Add to dashboard Cite

Abstract:In scheduling, estimations are affected by the imprecision of limited information on future events, and the reduction in the number and level of detail of activities. Overlapping of processes and activities requires the study of their continuity, along with analysis of the risks associated with imprecision. In this line, this paper proposes a fuzzy heuristic model for the Project Scheduling Problem with flows and minimal feeding, time and work Generalized Precedence Relations with a realistic approach to overlapping, in which the continuity of processes and activities is allowed in a discretionary way. This fuzzy algorithm handles the balance of process flows, and computes the optimal fragmentation of tasks, avoiding the interruption of the critical path and reverse criticality. The goodness of this approach is tested on several problems found in the literature; furthermore, an example of a 15-story building was used to compare the better performance of the algorithm implemented in Visual Basic for Applications (Excel) over that same example input in Primavera© P6 Professional V8.2.0, using five different scenarios.

show abstract

Concurrent Construction Scheduling Simulation Algorithm

Cited by 28 publications

References 41 publications

Optimization for Roads' Construction: Selection, Prioritization, and Scheduling

Optimization for Roads' Construction: Selection, Prioritization, and Scheduling

Modelling the boundaries of project fast-tracking

The Fuzzy Project Scheduling Problem with Minimal Generalized Precedence Relations

Contact Info

Product

Resources

About