SELECTIVE-PERMUTATIONAL METHOD FOR SOLVING PROBLEMS ON PARALLEL DISTRIBUTION OF TASKS AMONG PERFORMERS: SINGLE PERMUTATIONS

SELECTIVE-PERMUTATIONAL METHOD FOR SOLVING PROBLEMS ON PARALLEL DISTRIBUTION OF TASKS AMONG PERFORMERS: SINGLE PERMUTATIONS

Show other versions (1)

A new for the classical scheduling theory approach to solving distribution problems is offered. The approach is based on the introduction of the concepts of distribution matrices, estimate criteria of their properties and a developed algorithm of their enhancing transformations. The method named ‘se...

Full description

Bibliographic Details
Main Author: Rudolf A. Neydorf
Format: Article
Language:Russian
Published: Don State Technical University 2018-07-01
Series:Вестник Донского государственного технического университета
Subjects:
scheduling theory
allocation problem
optimization criterion
minimax criterion
selective approach
permutational algorithm
distribution matrix
resource column
single permutation.
Online Access:https://vestnik.donstu.ru/jour/article/view/844
Description
Summary:A new for the classical scheduling theory approach to solving distribution problems is offered. The approach is based on the introduction of the concepts of distribution matrices, estimate criteria of their properties and a developed algorithm of their enhancing transformations. The method named ‘selective-permutational’, as it is based on the selection and permutation of the perspective column elements of the distribution matrices, is formulated. Several examples are given.
ISSN:1992-5980
1992-6006

Similar Items