期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 313, 期 1, 页码 92-111出版社
ELSEVIER
DOI: 10.1016/j.ejor.2023.07.043
关键词
Project scheduling; Metaheuristics; Resource constrained project scheduling; problem; Flexible project structure
The resource constrained project scheduling problem is a complex issue. We introduce the concept of group graphs and propose a solution using a hybrid differential evolution algorithm, which has shown to be effective in practical applications.
The resource constrained project scheduling problem with a flexible project structure and consumption and production of resources, involves making a selection of activities and scheduling these activities in order to minimize the makespan, subject to precedence and resource constraints. Since finding a feasible selection of activities is NP-hard, we introduce the concept of group graphs and restrict ourselves to instances with an acyclic group graph. For these instances, which represent many practical cases, we show how to make a feasible selection of activities in polynomial time and use this concept to schedule the selected activities using a hybrid differential evolution algorithm. We compare this algorithm with an algorithm from the literature on special cases of instances without consumption and production of resources, and show that our algorithm creates solutions of higher quality. Furthermore, to compare general instances, we develop an ant colony optimization algorithm that performs slightly better on special cases than the algorithm from literature and show that the hybrid differential evolution algorithm outperforms the ant colony optimization algorithm on general instances. (c) 2023 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license ( http://creativecommons.org/licenses/by/4.0/ )
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据