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

Chinese Journal of Management Science ›› 2022, Vol. 30 ›› Issue (7): 241-251.doi: 10.16381/j.cnki.issn1003-207x.2019.1431

• Articles • Previous Articles     Next Articles

Max-NPV Project Scheduling Based on Optimizing the Resource Flow Network

LIANG Yang-yang1, WANG Tian2, CUI Nan-fang3   

  1. 1. School of Business Administration, Hubei University of Economics, Research Center of Hubei Logistics Development, Wuhan 430205, China;2. School of Business Administration, Zhongnan University of Economics and Laws, Wuhan 430073, China; 3. School of Management, Huazhong University of Science and Technology, Wuhan 430074, China
  • Received:2019-09-22 Revised:2019-12-17 Online:2022-08-05 Published:2022-08-05
  • Contact: 王田 E-mail:wangtian3261@gmail.com

Abstract: The Max-NPV problem is a new branch of the resource-constrained project scheduling problem (RCPSP), in which numerous models and algorithms for generating a workable baseline schedule (BS) have been advocated by various authors in a static and deterministic environment. During execution, however, a practical project is subject to high levels of uncertainty. As a result, one or more project activities may take more time than anticipated in the BS. Moreover, those activity delays can propagate throughout the resource flow network due to the constraints of both strictly technological precedence relations and resource-driven precedence relations, resulting in a kind of snowball effect and incurring great impacts on the expected project NPV especially for capital-intensive IT and construction projects. Therefore, it is crucial and practical to generate a stable baseline schedule to ensure that the realized payment time of cash flows occurs as closely as possible to its original plan in a stochastic environment.

Key words: activity delay; resource flow network; net present value; expected penalty cost

CLC Number: