Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/788
Title: | Comment on Icmeli and Erenguc's " a branch and bound procedure for the resourcen constrained project scheduling problem with discounted cash flows |
Authors: | Verma, Sanjay Dhavale, N. P. Bagchi, Amitava |
Keywords: | Net present value;Project scheduling;Resource constraints |
Issue Date: | 16-Jan-2010 |
Series/Report no.: | WP;Comment on Icmeli and Erenguc's " a branch and bound procedure for the resourcen constrained project scheduling problem with discounted cash flows by Sanjay Verma, N. P. Dhavale and Amitava Bagchi (Working Paper, No. 2000-04-03/1595 |
Abstract: | 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. |
URI: | http://hdl.handle.net/11718/788 |
Appears in Collections: | Working Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
WP 2000_1595.pdf | 337.04 kB | Adobe PDF | View/Open |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.