We consider optimal allocation of a scarce integer resource to operations in a network technological process. A polynomial-time dynamic programming algorithm is proposed for solving the allocation problem.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
V. S. Mikhalevich and A. I. Kuksa, Sequential Optimization Methods in Discrete Network Problems of Optimal Allocation of Resources [in Russian], Nauka, Moscow (1983).
M. I. Rubinshtein and A. M. Cherkashin, “Discrete problem of resource allocation in a network of operations,” Avtomat. Telemekh., No. 1, 146–152 (1980).
A. S. Pleshchinskii, “Network models of optimal planning and production control,” Ékon. Mat. Metody,18, No. 2, 288–296 (1982).
V. D. Zaruba, “Planning mechanisms for the allocation of a scarce resource,” Avtomat. Telemekh., No. 9, 110–120 (1984).
G. M. Adel'son-Vel'skii, E. A. Dinits, and A. V. Karzanov, Flow Algorithms [in Russian], Nauka, Moscow (1975).
Translated from Kibernetika, No. 3, pp. 53–61, 81, May–June, 1991.
About this article
Cite this article
Ptushkin, A.I., Lysenko, I.V. Optimal distribution of a scarce integer resource on a network of arbitrary topology. Cybern Syst Anal 27, 376–389 (1991). https://doi.org/10.1007/BF01068318
- Operating System
- Artificial Intelligence
- System Theory
- Dynamic Programming
- Technological Process