TY - JOUR
T1 - Project scheduling to minimize the makespan under flexible resource profiles and marginal diminishing returns of the resource
AU - Kogan, Boris
AU - Chernonog, Tatyana
AU - Herbon, Avi
N1 - Publisher Copyright:
© 2023 Elsevier Ltd
PY - 2024/1
Y1 - 2024/1
N2 - A standard approach to project scheduling that tackles the problem of minimizing the makespan under variable resource profiles is the Flexible Resource-Constrained Project Scheduling Problem (FRCPSP). This approach traditionally considers constant marginal returns from increasing the allocation of a particular resource, whereas in practice, project and operational managers are often faced with diminishing marginal returns. This work is the first to integrate these two interrelated aspects of resource allocation (flexible profiles and diminishing marginal returns) in order to determine the optimal resource allocation and project scheduling that will minimize the project makespan. This paper develops a mixed-integer linear programming model to obtain an optimal solution of the FRCPSP assuming diminishing marginal returns as the resource allocations are increased. In addition, to solve medium-sized instances of the problem, a heuristic algorithm based on relaxation of this mixed-integer programming model is presented. Through a series of computational tests, we further show that the average deviation in the makespan between the two strategies (optimal vs. heuristic solution) does not exceed 5%.
AB - A standard approach to project scheduling that tackles the problem of minimizing the makespan under variable resource profiles is the Flexible Resource-Constrained Project Scheduling Problem (FRCPSP). This approach traditionally considers constant marginal returns from increasing the allocation of a particular resource, whereas in practice, project and operational managers are often faced with diminishing marginal returns. This work is the first to integrate these two interrelated aspects of resource allocation (flexible profiles and diminishing marginal returns) in order to determine the optimal resource allocation and project scheduling that will minimize the project makespan. This paper develops a mixed-integer linear programming model to obtain an optimal solution of the FRCPSP assuming diminishing marginal returns as the resource allocations are increased. In addition, to solve medium-sized instances of the problem, a heuristic algorithm based on relaxation of this mixed-integer programming model is presented. Through a series of computational tests, we further show that the average deviation in the makespan between the two strategies (optimal vs. heuristic solution) does not exceed 5%.
KW - Diminishing marginal returns
KW - Flexible resource profiles
KW - Resource-constrained project
KW - Scheduling
UR - http://www.scopus.com/inward/record.url?scp=85173254699&partnerID=8YFLogxK
U2 - 10.1016/j.cor.2023.106440
DO - 10.1016/j.cor.2023.106440
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85173254699
SN - 0305-0548
VL - 161
JO - Computers and Operations Research
JF - Computers and Operations Research
M1 - 106440
ER -