4.7 Article

An integrated chance-constrained stochastic model for a preemptive multi-skilled multi-mode resource-constrained project scheduling problem: A case study of building a sports center

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.engappai.2023.106726

关键词

Project scheduling problem; Multiple skills; Activity preemption; Chance-constrained programming; Uncertainty

向作者/读者索取更多资源

This paper investigates a multi-mode resource-constrained project scheduling problem (MRCPSP) with multiple skills. A new multi-objective mixed-integer linear programming (MILP) model with three objective functions is proposed to minimize project makespan, total resource costs, and total project risk. The effectiveness of the proposed model is demonstrated through a real-world construction project. The results show that the proposed lexicographic optimization algorithm outperforms the AUGMECON method in all problem instances.
A multi-mode resource-constrained project scheduling problem (MRCPSP) with multiple skills is investigated in this paper. Unlike the traditional form of this problem, and considering the real-world project circumstances, project activities can be preempted. In this paper, a new multi-objective mixed-integer linear programming (MILP) model with three objective functions is extended. These objectives are: (1) minimizing the project makespan, (2) minimizing the total resource costs, and (3) minimizing the total project risk. Based on real-life projects, non-renewable resources are represented as an uncertain stochastic parameter. To cope with the uncertain environment, chance-constrained programming with a confidence level is considered. A real-world construction project of a sports center in Tehran is utilized to demonstrate the applicability of the presented formulation. A well-known lexicographic optimization method, namely AUGMECON2, is applied to solve the proposed formulation with three objectives. Ultimately, for the case study and two datasets J30 and MM50, the proposed lexicographic optimization algorithm is compared with an efficient multi-objective mathematical programming technique known as the AUGMECON method. The comparison is based on performance metrics (i.e., IGD and HV) commonly used in multi-objective optimization. The results show the relative dominance of the proposed lexicographic optimization algorithm over the AUGMECON method in all sizes of the problem instances.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据