Comment on Icmeli and Erenguc's " a branch and bound procedure for the resourcen constrained project scheduling problem with discounted cash flows

dc.contributor.author	Verma, Sanjay
dc.contributor.author	Dhavale, N. P.
dc.contributor.author	Bagchi, Amitava
dc.date.accessioned	2010-01-16T11:45:25Z
dc.date.available	2010-01-16T11:45:25Z
dc.date.copyright	2000-04
dc.date.issued	2010-01-16T11:45:25Z
dc.identifier.uri	http://hdl.handle.net/11718/788
dc.description.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.	en
dc.language.iso	en	en
dc.relation.ispartofseries	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
dc.subject	Net present value	en
dc.subject	Project scheduling	en
dc.subject	Resource constraints	en
dc.title	Comment on Icmeli and Erenguc's " a branch and bound procedure for the resourcen constrained project scheduling problem with discounted cash flows	en
dc.type	Working Paper	en