Use of the approximate method for solving the assignment problem

Marco Maria () and Tsegelik Grigorii
Additional contact information
Marco Maria: Ivan Franko National University of Lviv
Tsegelik Grigorii: Ivan Franko National University of Lviv

Technology audit and production reserves, 5(37) 2017, 2017, vol. 5, issue 5(37), 31-33

Abstract: 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.

Keywords: approximate method; approximate solution; assignment problem (search for similar items in EconPapers)
JEL-codes: C61 (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://journals.uran.ua/tarp/article/view/113285

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:nos:itrzhq:16

Access Statistics for this article

More articles in Technology audit and production reserves, 5(37) 2017 from Socionet, Technology audit and production reserves
Bibliographic data for series maintained by Алина Макаренко ().