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

Abstract

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.

Keywords

• scheduling theory
• allocation problem
• optimization criterion
• minimax criterion
• selective approach
• permutational algorithm
• distribution matrix
• resource column
• single permutation.