Open AccessA New Technique for Finding the Optimal Solution to Assignment Problems with Maximization Objective Function
Author(s) -
Haleemah Jawad Kadhim,
Mushtak A. K. Shiker,
Hussein A. H. Al-Dallal
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1963/1/012104
Subject(s) - maximization , mathematical optimization , generalized assignment problem , task (project management) , weapon target assignment problem , assignment problem , computer science , variety (cybernetics) , function (biology) , linear programming , optimal allocation , mathematics , artificial intelligence , engineering , systems engineering , evolutionary biology , biology
The assignment problems (AP) are an important part of linear programming problems (LPP) that deal with the allocation of different resources for different activities based on one to one. The assignment problem is established in a variety positions when decision makers need to determine the optimal allocation and this means assigning only one task to one person to achieve maximum profits or imports or achieve less time or less cost based on the type of problem. In this work, a new technique has been provided to find an optimal solution for the assignment problems of maximization objective function. Comparing the proposed technique results with the Hungarian method indicates that the new technique has easier and less steps to find the optimal solution and thus the time is reduced and the effort is largely reduced.