OPTIMALISASI MASALAH PENUGASAN TIDAK SEIMBANG MENGGUNAKAN MODIFIED HUNGARIAN METHOD

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.

Downloads

Download data is not yet available.

Author Biographies

RENALDO EVIPANIA, Universitas Udayana

Program Studi Matematika, Fakultas MIPA – Universitas Udayana

G.K. GANDHIADI, Universitas Udayana

Program Studi Matematika, Fakultas MIPA – Universitas Udayana

I WAYAN SUMARJAYA, Universitas Udayana

Program Studi Matematika, Fakultas MIPA – Universitas Udayana

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://ojs.unud.ac.id/index.php/mtk/article/view/70191>. Date accessed: 19 june 2021. doi: https://doi.org/10.24843/MTK.2021.v10.i01.p316.
Section
Articles

Most read articles by the same author(s)