Complexity of some project scheduling problem with nonrenewable resources

In this paper the project scheduling problem with nonreneawble resources and criterion of Net Present Value is considered. We prove that this problem is strongly $NP$-hard. Special case of independent jobs was investigated. We propose the exact algorithm for this case of the problem which is based on dynamic programming scheme. We obtain the cases of the problem when the algorithm became pseudopolynomial.