Authors:

RENALDO EVIPANIA, G.K. GANDHIADI, I WAYAN SUMARJAYA

Abstract:

“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.”

Keywords

Keyword Not Available

Downloads:

Download data is not yet available.

References

References Not Available

PDF:

https://jurnal.harianregional.com/mtk/full-70191

Published

2021-01-31

How To Cite

EVIPANIA, RENALDO; GANDHIADI, G.K.; SUMARJAYA, I WAYAN. OPTIMALISASI MASALAH PENUGASAN TIDAK SEIMBANG MENGGUNAKAN MODIFIED HUNGARIAN METHOD.E-Jurnal Matematika, [S.l.], v. 10, n. 1, p. 26-31, jan. 2021. ISSN 2303-1751. Available at: https://jurnal.harianregional.com/mtk/id-70191. Date accessed: 28 Aug. 2025. doi:https://doi.org/10.24843/MTK.2021.v10.i01.p316.

Citation Format

ABNT, APA, BibTeX, CBE, EndNote - EndNote format (Macintosh & Windows), MLA, ProCite - RIS format (Macintosh & Windows), RefWorks, Reference Manager - RIS format (Windows only), Turabian

Issue

Vol 10 No 1 (2021)

Section

Articles

Creative Commons License This work is licensed under a Creative Commons Attribution 4.0 International License