Stochastic resource leveling in projects with flexible structures
•Investigate stochastic resource leveling in projects with flexible structures.•Offer a stochastic programming-based algorithm and a differential evolution algorithm.•Devise a simulation-based evaluation algorithm to evaluate the scheduling policies.•Compare the proposed algorithms with state-of-the...
Saved in:
| Published in: | Computers & operations research Vol. 169; p. 106753 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Ltd
01.09.2024
|
| Subjects: | |
| ISSN: | 0305-0548, 1873-765X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | •Investigate stochastic resource leveling in projects with flexible structures.•Offer a stochastic programming-based algorithm and a differential evolution algorithm.•Devise a simulation-based evaluation algorithm to evaluate the scheduling policies.•Compare the proposed algorithms with state-of-the-art meta-heuristics.•Analyze the value of stochastic information after adopting the proposed algorithms.
In project management, efficient utilization of resources plays a key role in project success, and resource leveling is an effective technique to optimize resource usage. During project execution, there are often uncertainties that complicate resource leveling. Furthermore, existing research on resource leveling typically assumes a fixed project structure. However, this is not always the case in practice, because there may be a variety of optional technical solutions for some activities, leading to a flexible project structure. Therefore, considering both stochastic activity durations and flexible project structures, we propose and study the stochastic resource leveling problem with flexible project structures (SRLP-PS). The solution of the SRLP-PS is in the form of a scheduling policy. We design two algorithms for solving the NP-hard SRLP-PS: (a) an exact algorithm based on stochastic programming, in which we formulate a scenario-based non-linear stochastic programming model and linearize it into an equivalent deterministic mixed-integer linear programming model that can be directly solved by CPLEX; and (b) an improved differential evolution algorithm, which is equipped with several problem-specific components, such as two mutation operators balancing exploration and exploitation, initialization, and local improvement search. Extensive computational experiments on a large number of benchmark instances are performed to validate our algorithms, which are also compared with state-of-the-art meta-heuristics. The computational results reveal the effectiveness and competitiveness of our algorithms. We also analyze the value of stochastic information based on the exact algorithm and the meta-heuristics, respectively. |
|---|---|
| ISSN: | 0305-0548 1873-765X |
| DOI: | 10.1016/j.cor.2024.106753 |