The assignment problem is important matter in the field of information technology, because It treats with assigning one of methods of managing a set of works estimated as (n) that are Symbolized (W1, W2, W3,…..Wn) by using one of available machines that are Symbolized (M1, M2, M3,…..Mn), with minimum cost which is counted by (∑Cij). There are several methods handling this case such as Hungarian’s method. In this paper, will been use graphs by converting an assignment into a complete bipartite graph using Kruskal’s Algorithm in order to find the minimum spanning tree, and obtaining the most optimal assignment. The results of various cases were compared, and the results were satisfying in both methods, whereas the method Kruscal’s algorithm was easiest to have optimal solution.
Real Time Impact Factor:
Pending
Author Name: Dr. Nadia Moqbel Hassan Al-ZUBAYDI
URL: View PDF
Keywords: Kruskal's Method, Hungarian Algorithm, Assignment.
ISSN:
EISSN: 2717-8234
EOI/DOI:
Add Citation
Views: 1
