Use of the approximate method for solving the assignment problem
DOI:
https://doi.org/10.15587/2312-8372.2017.113285Keywords:
approximate method, approximate solution, assignment problemAbstract
The object of research is the assignment problem, which consists in finding the minimum (or maximum) weight between the elements of two finite sets. An approximate method of solving the assignment problem is considered, which makes it possible to distribute the workers in such way so that the total costs in performing the work are minimal. Also, an algorithm is constructed to solve the task of assigning workers for work distribution, using the Hungarian method, where in a specific example, its use is shown. Three iterations are carried out, that is, one worker is relocated from work, after which more than one worker is assigned to work, for which no worker is assigned. Also, an approximate method to solve this problem is used and a concrete example is given. These algorithms allow to find the minimum costs when performing work by workers.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2017 Maria Marco
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.