Comment on Icmeli and Erenguc's " a branch and bound procedure for the resourcen constrained project scheduling problem with discounted cash flows
View/ Open
Date
2010-01-16Author
Verma, Sanjay
Dhavale, N. P.
Bagchi, Amitava
Metadata
Show full item recordAbstract
In a recent paper, Icmeli and Erengue (1996) present an algorithm to maximize the Net Present Value (NPV) of a given project under renewable resource constraints. It is shown here, with the help of an example, that in some cases the algorithm fails to find an optimal solution. A simple modification in the last step of the algorithm resolves the problem.
Collections
- Working Papers [2627]