Fuzzy Optimal Model for Resource-Constrained Construction Scheduling

“…Leu et al. () extended a genetic algorithm (GA) for resource leveling to overcome other old algorithms, in which the GA has been used for showing the difference between traditional and heuristic approaches. Leu et al.…”

Section: Introductionmentioning

confidence: 99%

Multiobjective model for solving resource‐leveling problem with discounted cash flows

Abadi

Bagheri

Assadi

2016

Int Trans Operational Res

View full text Add to dashboard Cite

Nowadays, executers are struggling to improve the economic and scheduling situation of projects. Construction scheduling techniques often produce schedules that cause undesirable resource fluctuations that are inefficient and costly to implement on site. The objective of the resource-leveling problem is to reduce resource fluctuation related costs (hiring and firing costs) without violating the project deadline. In this article, minimizing the discounted costs of resource fluctuations and minimizing the project makespan are considered in a multiobjective model. The problem is formulated as an integer nonlinear programming model, and since the optimization problem is NP-hard, we propose multiobjective evolutionary algorithms, namely nondominated sorting genetic algorithm-II (NSGA-II), strength Pareto evolutionary algorithm-II (SPEA-II), and multiobjective particle swarm optimization (MOPSO) to solve our suggested model. To evaluate the performance of the algorithms, experimental performance analysis on various instances is presented. Furthermore, in order to study the performance of these algorithms, three criteria are proposed and compared with each other to demonstrate the strengths of each applied algorithm. To validate the results obtained for the suggested model, we compared the results of the first objective function with a well-tuned genetic algorithm and differential algorithm, and we also compared the makespan results with one of the popular algorithms for the resource constraints project scheduling problem. Finally, we can observe that the NSGA-II algorithm presents better solutions than the other two algorithms on average.

show abstract

“…Existing approaches for reducing schedule durations include time-cost trade-off (e.g., [3][4][5][6]) and resource-constrained scheduling (e.g., [7][8][9][10]). These methods assume that existing sequences in CPM schedules are fixed and that the primary method for acceleration is to add or reallocate resources.…”

Section: Introductionmentioning

confidence: 99%