The Problem of Controlling Resources on Network Graphs as an Optimal Control Problemстатья
Информация о цитировании статьи получена из
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 28 мая 2015 г.
Аннотация:The problem of optimal distribution of resources dedicated to a certain complex of inter
related tasks according to the criterion of minimum execution time of all tasks is described. A reenterable
(reusable) resource is considered instead of a traditional separabletype resource supposing a fixed distribu
tion among tasks. The problem is formalized in direct static and dynamic settings. The latter is a classical
performance optimal control problem. The correctness of the formalization is substantiated.