主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

Chinese Journal of Management Science ›› 2004, Vol. ›› Issue (6): 73-80.

Previous Articles     Next Articles

A Heuristic of RCPSPDC

MA Meng-meng1,2, CAI Chen2, WANG Zhao-xiang2   

  1. 1. University of Science and Technology of China, Hefei 230026, China;
    2. Institute of Policy and Management, Chinese Academy of Sciences, Beijing 100080, China
  • Received:2004-09-22 Online:2004-12-28 Published:2012-03-07

Abstract: How to maximize the net present value of the project subject to the resource constraints is the focus of project scheduling.This article studies the RCPSPDC related to lump-sum contracts and develops a heuristic algorithm named Min{L&F},which ranks the schedule sequence of the activities in the eligible set according to their Min{L&F} and will contribute to the objective of the maximization of the net present value.In order to prove its effectiveness,the heuristic is applied to a numerical example for comparison.

Key words: resource constraints, cash flow, NPV, project scheduling

CLC Number: