Modified Romanovsky algorithm for quick finding of approximate solution to homogeneous allocation problem
Автор: Neydorf Rudolf A., Zhikulin Artem A.
Журнал: Вестник Донского государственного технического университета @vestnik-donstu
Рубрика: Технические науки
Статья в выпуске: 6 (67) т.12, 2012 года.
Бесплатный доступ
The modification of Romanovsky algorithm for the approximate solution to the homogeneous allocation problem is developed. The modification involves lower resource requirements as against the original algorithm. The changes in the original algorithm which permit to provide a more effective procedure of loading executors with tasks are described. The computational experiments are resulted.
Scheduling theory, homogeneous problem, minimax criterion, branch-and-bound method, search tree
Короткий адрес: https://sciup.org/14249906
IDR: 14249906