Hybrid algorithm for scheduling with regard for reinvestment of profits

Scheduling of the interrelated jobs of an investment project was considered. The project can be partially financed from the means obtained by executing its jobs. The net profit value was used as the optimization criterion. This problem is NP-hard. A new hybrid algorithm based on a combination of the branch-and-bound and dynamic algorithms was proposed to determine its optimal solution.

Presented by the member of Editorial Board: A. I. Kibzun