TY - JOUR
ID - 2862
TI - Multi-objective Optimization of Multi-mode Resource-constrained Project Selection and Scheduling Problem Considering Resource Leveling and Time-varying Resource Usage
JO - International Journal of Supply and Operations Management
JA - IJSOM
LA - en
SN - 23831359
AU - Davari Ardakani, Hamed
AU - Dehghani, Ali
AD - Department of Industrial Engineering, Faculty of Engineering, Kharazmi University, Tehran, Iran
AD - Department of Industrial Engineering and Management, Shahrood University of Technology, Shahrood, Iran
Y1 - 2022
PY - 2022
VL - 9
IS - 1
SP - 34
EP - 55
KW - Project Portfolio Selection
KW - Multi-mode Resource Constrained Project Scheduling Problem (MRCPSP)
KW - Multi-objective optimization
KW - Resource Leveling
KW - Time-Varying Resource Consumption
KW - Time Value of Money
DO - 10.22034/ijsom.2021.108651.1843
N2 - In this paper, a multi-objective mixed-integer programming model is developed to cope with the multi-mode resource-constrained project selection and scheduling problem, aiming to minimize the makespan, maximize the net present value of project cash flows, and minimize the fluctuation of renewable resource consumption between consecutive time periods. Moreover, activities are considered to be subject to generalized finish-to-start precedence relations, and time-varying resource usage between consecutive time periods. To assess the performance of the proposed model, 30 different-sized numerical examples are solved using goal programming, epsilon constraint, and augmented epsilon constraint methods. Afterward, Tukey test is used to statistically compare the solution methods. Moreover, VIKOR method is used to make an overall assessment of the solution methods. Statistical comparisons show that there is a significant difference between the mean of the resource leveling objective functions for all the solution methods. In other words, goal programming statistically outperforms other solution methods in terms of the resource leveling objective function. This is not the case for the other objective functions and CPU times. In addition, results of the VIKOR method indicate that the goal programming method outperforms the other solution methods. Hence, goal programming method is used to perform some sensitivity analyses with respect to the main parameters of the problem. Results show that by improving any of the parameters at least one objective function improves. However, due to the conflicting nature and the impact of weights of objective functions, in most cases, the trend are not constant to describe a general pattern.
UR - http://www.ijsom.com/article_2862.html
L1 - http://www.ijsom.com/article_2862_ae654bae3d2ac309938f696f43554fc0.pdf
ER -