Synthesis of Group Incentive Systems on the Basis of Heuristic Algorithms

Abstract

The task of synthesizing the system of incentives for executives is considered with the aim of ensuring the project implementation deadlines. This problem occurs when, with the accepted method of organizing the execution of work on a project, the period for its implementation exceeds the allowable one. In this case, a list of organizational and technological measures is being developed, aimed at reducing the duration of the work that constitutes the project. The cost of reducing the duration of work is linearly dependent on the magnitude of this reduction. The incentive system is designed to offset these costs performers. In the system of group incentives, all projects are divided into several groups, and each group has its own incentive system. It is shown that the most preferable will be a group incentive system that combines the advantages of both individual and collective incentive systems. A task is considered when the number of groups is set into which it is necessary to divide the whole set of project works, and the number of works in groups is assumed to be two. This formulation of the problem can be represented as a graph. It is shown that in this case the problem reduces to determining the maximum matching of the minimum weight. A heuristic algorithm for solving this problem is given.