|
Avtomatika i Telemekhanika, 2004, Issue 3, Pages 100–107
(Mi at1545)
|
|
|
|
This article is cited in 8 scientific papers (total in 8 papers)
Discrete Optimization
Hybrid algorithm for scheduling with regard for reinvestment of profits
V. V. Servakh, S. L. Sukhikh Omsk Branch of Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Science
Abstract:
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.
Citation:
V. V. Servakh, S. L. Sukhikh, “Hybrid algorithm for scheduling with regard for reinvestment of profits”, Avtomat. i Telemekh., 2004, no. 3, 100–107; Autom. Remote Control, 65:3 (2004), 449–455
Linking options:
https://www.mathnet.ru/eng/at1545 https://www.mathnet.ru/eng/at/y2004/i3/p100
|
Statistics & downloads: |
Abstract page: | 227 | Full-text PDF : | 72 | References: | 44 | First page: | 2 |
|