SPEEDING ALGORITHM FOR MINIMAX OPTIMIZATION OF ALLOCATION PROBLEM SOLUTIONS IN HOMOGENEOUS SYSTEMS

SPEEDING ALGORITHM FOR MINIMAX OPTIMIZATION OF ALLOCATION PROBLEM SOLUTIONS IN HOMOGENEOUS SYSTEMS

The optimization algorithm for solving homogeneous allocation problems of the scheduling theory is described and proved. It is a modification of Romanovsky’s algorithm known in this problem domain. Romanovsky’s algorithm is a classical version of the branch-and-bound method with one-way traversing a...

Full description

Bibliographic Details
Main Authors: Rudolf Anatolyevich Neydorf, Artem Alexandrovich Zhikulin
Format: Article
Language:Russian
Published: Don State Technical University 2014-09-01
Series:Advanced Engineering Research
Subjects:
scheduling theory
allocation problem
romanovsky’s algorithm
decision tree
combination search
job size
combinations
permutations.
Online Access:https://www.vestnik-donstu.ru/jour/article/view/332

Internet

https://www.vestnik-donstu.ru/jour/article/view/332

Similar Items