资源约束型Max-npv项目调度问题的分枝定界算法

Resource-constrained Max-npv project scheduling problem and branch and bound algorithm

研究资源约束下的Max-npv项目调度问题.首先给出该问题的数学模型,随后基于求解无资源约束Max-npv项目调度问题的快速递归搜索方法,设计资源约束型Max-npv项目调度问题的分枝定界算法。利用算例进行求解分析,验证了分枝定界算法的可行性.计算结果表明,项目收益随折现率的提高而下降,随截止日期的延长而上升.

The resource-constrained Max-npv project scheduling problem was studied. Firstly, the mathematical model of the problem was given, then a branch and bound algorithm for the resource-constrained Max-npv project scheduling problem was designed on the basis of rapid recursion search method. The feasibility of branch and bound algorithm was verified by using an example. The results show that the project profit drops with the increase of the cash discount rate, while increase with the prolongation of the project deadline.