Exchange algorithm of biextremal solution to homogeneous allocation problem

Автор: Neydorf Rudolph A., Filippov Anton V., Yagubov Zafar Khangusein-Ogly

Журнал: Вестник Донского государственного технического университета @vestnik-donstu

Рубрика: Технические науки

Статья в выпуске: 5 (56) т.11, 2011 года.

Бесплатный доступ

An effective algorithm of constructing optimal solutions to homogeneous allocation problems is developed. It is called a biextremal solution algorithm because it permits to find the distribution carrying an extremum to two popular distribution evaluations simultaneously: uniformity of distribution criterion and minimax criterion. The principle of its operation consists in formalizing structure transformation of the core-image matrix derived by Romanovsky's algorithm with further formalized rearrangement of tasks between their executors. An example of incremental solution to the particular problem is provided.

Algorithm, theory of scheduling, allocation problem, homogeneous system, optimization criterion, biextremal solution, permutable rule

Короткий адрес: https://sciup.org/14249599

IDR: 14249599

Статья научная