Scheduling a project to maximize its net present value: An integer programming approach
- 22 January 1993
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 64 (2), 188-198
- https://doi.org/10.1016/0377-2217(93)90176-n
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problemsEuropean Journal of Operational Research, 1990
- Maximizing the net present value of a project subject to materials and capital constraintsJournal of Operations Management, 1987
- Project scheduling with resource constraints: A branch and bound approachEuropean Journal of Operational Research, 1987
- A Comparison of Heuristics for Scheduling Projects with Cash Flows and Resource RestrictionsManagement Science, 1986
- A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling ProblemManagement Science, 1984
- Multiple Resource–Constrained Scheduling Using Branch and BoundA I I E Transactions, 1978
- An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling ProblemsManagement Science, 1978
- Scheduling a Project Under Multiple Resource Constraints: A Zero-One Programming ApproachA I I E Transactions, 1976
- The payment scheduling problemNaval Research Logistics Quarterly, 1972
- Cash Flows in NetworksManagement Science, 1970