This study utilizes a time-precedence network technique to construct two models of multi-mode resource constrained project scheduling problem with discounted cash flows （MRCPSPDCF）, individually including the progre...This study utilizes a time-precedence network technique to construct two models of multi-mode resource constrained project scheduling problem with discounted cash flows （MRCPSPDCF）, individually including the progress payment （PP） and the payment at an equal time interval （ETI）. The objective of each model is to maximize the net present value （NPV） for all cash flows in the project, subject to the related operational constraints. The models are characterized as NP-hard. A heuristic algorithm, coupled with two upper bound solutions, is proposed to efficiently solve the models and evaluate the heuristic algorithm performance which was not performed in past studies. The results show that the performance of proposed models and heuristic algorithm is good.展开更多
文摘This study utilizes a time-precedence network technique to construct two models of multi-mode resource constrained project scheduling problem with discounted cash flows （MRCPSPDCF）, individually including the progress payment （PP） and the payment at an equal time interval （ETI）. The objective of each model is to maximize the net present value （NPV） for all cash flows in the project, subject to the related operational constraints. The models are characterized as NP-hard. A heuristic algorithm, coupled with two upper bound solutions, is proposed to efficiently solve the models and evaluate the heuristic algorithm performance which was not performed in past studies. The results show that the performance of proposed models and heuristic algorithm is good.
