OPTIMALISASI MASALAH PENUGASAN TIDAK SEIMBANG MENGGUNAKAN MODIFIED HUNGARIAN METHOD
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 foun...
Saved in:
| Published in: | E-jurnal matematika Vol. 10; no. 1; pp. 26 - 31 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Universitas Udayana
31-01-2021
|
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| ISSN: | 2303-1751 2303-1751 |
| DOI: | 10.24843/MTK.2021.v10.i01.p316 |