期刊
COMPUTING
卷 101, 期 6, 页码 547-570出版社
SPRINGER WIEN
DOI: 10.1007/s00607-018-00693-1
关键词
Multi-mode resource-constrained project scheduling problem; NPV; Payment planning; epsilon-Constraint method; NSGA-II; MOSA
资金
- International Scientific and Techological Cooperation Project of Dongguan [2016508102011]
This study addresses the multi-objective multi-mode resource-constrained project scheduling problem with payment planning where the activities can be done through one of the possible modes and the objectives are to maximize the net present value and minimize the completion time concurrently. Moreover, renewable resources including manpower, machinery, and equipment as well as non-renewable ones such as consumable resources and budget are considered to make the model closer to the real-world. To this end, a non-linear programming model is proposed to formulate the problem based on the suggested assumptions. To validate the model, several random instances are designed and solved by GAMS-BARON solver applying the epsilon-constraint method. For the high NP-hardness of the problem, we develop two metaheuristics of non-dominated sorting genetic algorithm II and multi-objective simulated annealing algorithm to solve the problem. Finally, the performances of the proposed solution techniques are evaluated using some well-known efficient criteria.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据