Complexity of the project scheduling problem with credits

We consider the profit maximization problem in the calendar planning of investment projects taking into account reinvestment of the obtained revenue and the possibility of using credits. We construct the corresponding models and study their properties. Strong NP-hardness of the profit maximization problem is proved in the case when the amount of the credit is not limited.