This article is cited in 6 papers

The complexity of the project scheduling problem with credits

E. A. Kazakovtseva^a, V. V. Servakh<sup>ab

a</sup> Omsk State University, 55-a Mir Ave., 644077 Omsk, Russia
^b Omsk Branch of Sobolev Institute of Mathematics of SB RAS, 13 Pevtsov St., 644099 Omsk, Russia

Abstract: We consider the profit maximization problem in calendar planning of investment projects taking into account reinvesting of the obtained revenue and possible credit financing. We construct corresponding models and study characteristics of these models. Strong NP-hardness of the profit maximization problem is proved when the amount of the used credits is not limited. Bibliogr. 11.

Keywords: project scheduling, investment project, NPV criterion, credit.

UDC: 519.85

Received: 20.02.2015
Revised: 06.04.2015

DOI: 10.17377/daio.2015.22.478

 English version: Journal of Applied and Industrial Mathematics, 2015, 9:4, 489–496

Bibliographic databases:

• 
•