Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ South Ural State Uni...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Задачи оперативного управления проектами

Authors: Burkov, V. N.; Burkova, I. V.; Uandykov, K. B.;

Задачи оперативного управления проектами

Abstract

Рассматриваются задачи оперативного управления проектами. Задачи заключаются в сокращении срока завершения проекта до требуемой величины с минимальными затратами. Предполагается, что для каждой работы существует вариант сокращения ее продолжительности. Предложен эффективный алгоритм решения задачи для случая, когда функции затрат являются дискретными, для сетевого графика, имеющего вид дерева, а также для агрегируемых сетевых графиков. Доказываются теоремы о необходимых и достаточных условиях для того, чтобы сетевой график был агрегируемым, об оценке снизу для исходной задачи и о сведении задачи выбора значений переменных, максимизирующих нижнюю оценку, к задаче выпуклого программирования. Для общего случая предложен метод ветвей и границ с получением оценок на основе метода сетевого программирования. We consider the problems of operational management of projects. The tasks are to reduce the completion date of the project to the desired value with minimal cost. It is assumed that for each job there is the variant of reducing its duration. An efficient algorithm for solving the problem for the case when cost functions are discrete, for a network graph with tree view, and for the aggregated networks is suggested. Theorems about necessary and sufficient conditions in order that the network graph has been aggregated, about the lower evaluation for the original problem and the reduction of the problem of the variables choice maximized the lower bound to the problem of convex programming are proved. For the general case of the method of branches and borders with obtaining of the estimates based on the method of network programming is suggested Бурков Владимир Николаевич, д-р техн. наук, заведующий лабораторией активных систем, Институт проблем управления им. В.А. Трапезникова РАН, г. Москва; vlab17@bk.ru. Буркова Ирина Владимировна, д-р техн. наук, ведущий научный сотрудник лаборатории активных систем, Институт проблем управления им. В.А. Трапезникова РАН, г. Москва; Irbur27@mail.ru. Уандыков Берик Кусманович, канд. техн. наук, директор РГП «Актауский международный морской торговый порт», г. Актау, Казахстан; baha_astana_1985@mail.ru. V.N. Burkov1, vlab17@bk.ru, I.V. Burkova1, Irbur27@mail.ru, K.B. Uandykov2, baha_astana_1985@mail.ru V.A. Trapeznikov Institute of Control Sciences of Russian Academy of Sciences, Moscow, Russian Federation, Republican State Enterprise “Aktausky International Sea Trade Port”, Aktau, Kazakhstan

Keywords

mathematical models of project management, модели объемно-календарного планирования, УДК 005.8, УДК 001.891.573, математические модели управления проектом, model master scheduling

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Green