Open AccessOPTIMALISASI MASALAH PENUGASAN TIDAK SEIMBANG MENGGUNAKAN MODIFIED HUNGARIAN METHOD
Author(s) -
Renaldo Evipania,
G.K. Gandhiadi,
I Wayan Sumarjaya
Publication year - 2021
Publication title -
e-jurnal matematika
Language(s) - English
Resource type - Journals
ISSN - 2303-1751
DOI - 10.24843/mtk.2021.v10.i01.p316
Subject(s) - assignment problem , hungarian algorithm , computer science , mathematical optimization , linear programming , variable (mathematics) , operations research , algorithm , mathematics , mathematical analysis
Assignment problem is one of the cases that found in linear programming. Assignment problem is related to the allocation of workers for available jobs. From several sources, Hungarian method is more often used to solve the assignment problem. In the Hungarian method, if an unbalanced problem is found, the lack of the source or destination will be added to the dummy variable so that the case becomes balanced. The jobs that executed on the dummy machine will be ignored. In real-life situations, it is impossible for companies to ignore existing work because of a lack of workers. Therefore, the Hungarian method is modified to resolve this condition, so that the total assignment cost can still be optimized.