摘要
首先介绍了不受资源约束Max-npv项目进度问题在模型和算法方面的研究进展;随后,根据资源约束类型的不同,对可更新、不可更新及双重资源约束Max-npv项目进度问题的研究成果,特别是优化算法和启发式算法的设计进行了概述;最后,对Max-npv项目进度问题的研究现状进行了总结并指出进一步的研究方向。
The models and algorithms developed for resource-unconstrained max-npv problems are presented firstly. Then according to the type of resource constraints, the fruits of the researches on renewable, nonrenewable, and doubly constrained resource-constrained max-npv problems, especially the design of optimal and heuristic algorithms, are discussed respectively. Ultimately, the author summarizes the developments of max-npv project scheduling problems and indicates several directions for further research.
出处
《管理工程学报》
CSSCI
2005年第4期60-63,共4页
Journal of Industrial Engineering and Engineering Management
基金
国家自然科学基金重大项目(59990470-4)
山西省软科学研究项目(031047-4)
关键词
净现金值
项目进度安排
模型
优化算法
启发式算法
net present value
project scheduling
model
optimal algorithm
heuristic algorithm
