Abstract
In the paper a new type of assignment problem is formulated, in which the costs of assigning tasks to candidates are intuitionistic fuzzy pairs. Additional constraints are formulated to the problem: an upper limit to the cost of assigning a particular resource to perform a particular activity and preferences defined in advance for assigning the resources by an index matrix. We propose for the first time the Hungarian algorithm for finding an optimal solution of this new type of assignment problem, based on the concept of index matrices.
Author supplied keywords
Cite
CITATION STYLE
Traneva, V., Tranev, S., & Atanassova, V. (2019). An intuitionistic fuzzy approach to the hungarian algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11189 LNCS, pp. 167–175). Springer Verlag. https://doi.org/10.1007/978-3-030-10692-8_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
