PROJECT SELECTION AND SEQUENCING TO MAXIMIZE NET PRESENT VALUE OF THE TOTAL RETURN

被引：22

作者：

GUPTA, SK ^{[1
]}

KYPARISIS, J ^{[1
]}

IP, CM ^{[1
]}

机构：

[1] UNIV MIAMI,COLL ENGN,DEPT IND ENGN,CORAL GABLES,FL 33124

来源：

MANAGEMENT SCIENCE | 1992年 / 38卷 / 05期

关键词：

PROJECT SELECTION; SEQUENCING SCHEDULING; DYNAMIC PROGRAMMING;

D O I：

10.1287/mnsc.38.5.751

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This note considers a problem of simultaneous selection of a subset of N projects and determination of an optimal sequence to implement these projects so as to maximize the net present value of the total return. We first establish an optimal sequence of all projects which does not depend on the particular subset of selected projects and then propose an efficient polynomial dynamic programming method for solving the problem.

引用

页码：751 / 752

页数：2