Solving a multicriteria scheduling problem using a genetic algorithm

Abstract

The work is devoted to the multiobjective task of scheduling, in which a given set of works must be performed by several performers of different productivity. A certain number of bonuses is accrued for the work performed by the respective executor, which depends on the time of work performance. The criteria for evaluating the schedule are the total time of all jobs and the amount of bonuses spent. In the research the main approaches to solving multiobjective optimization problems were analyzed, based on which the Pareto approach was chosen. The genetic algorithm was chosen as the algorithm. The purpose of this work is to increase the efficiency of solving multicriteria optimization problems by implementing a heuristic algorithm and increase its speed. The tasks of the work are to determine the advantages and disadvantages of the approaches used to solve multicriteria optimization problems, to develop a genetic algorithm for solving the multicriteria scheduling problem and to study its efficiency. Operators of the genetic algorithm have been developed, which take into account the peculiarities of the researched problem and allow to obtain Pareto solutions in the process of work. Due to the introduction of parallel calculations in the implementation of the genetic algorithm, it was possible to increase its speed compared to the conventional version. The developed algorithm can be used in solving the problem of optimal allocation of resources, which is part of the system of accrual of bonuses to employees.