PENYELESAIAN MASALAH PENUGASAN PADA PENEMPATAN POSISI DENGAN ALGORITMA HUNGARIA

Tintin Chandra

Abstract


In business always find out where an worker take many job and sometime one job do by many worker. Although job or employee depend the condition where area duty. If we talk about safety, maybe need more worker like fireman, policeman, soldiers, etc. If we talk position, so never one position have many worker to do the job like President, Vice President, Ministry, etc. So to make optimal we use Hungarian Method to help solve problem. Result of solution can be solve with same count worker with job or different count between worker with job. Algorithm Hungarian develop by Kuhn at based mathematical from another person such as Denes Konig and Jeno Egervary. Solution from Algortihm Hungarian expected to optimal cost with optimal job. So the company or firm can use this technic to solve or eliminate worker to pass the position with specialization or requirements skill to do the job.

References


So, I. G., Penerapan Metode Hungarian Pada Perusahaan Jasa (Kasus Minimum), Management Department, School of Business Management, BINUS University, Binus Business Review Vol. 4 No. 2 November 2013: 812-820.

Susanto. A., 2006, Penggunaan Algoritma Hungarian Dalam Menyelesaikan Persoalan Matriks Berbobot, Makalah IF2251 Strategi Algoritmik Tahun 2008, Program Studi Teknik Informatika, ITB.

R. Erlinda, Neva Satyahadewi, Fransiskus, Optimalisasi Masalah Penugasan Menggunakan Metode Hungaria (Studi kasus pada PT Pos Indonesia (Persero) Pontianak), Buletin Ilmiah Mat. Stat. dan Terapannya (Bimaster), Volume 04, No. 3.

Siswanto, (2007), Operation Research, Jilid I, Erlangga, Jakarta, hal. 314-327.

Paendong1, M., Jantje D. Prang, Optimisasi Pembagian Tugas Karyawan Menggunakan Metode Hungarian, Program Studi Matematika FMIPA, Universitas SamRatulangi, Jurnal Ilmiah Sains Vol. 11 No. 1, April 2011.


Refbacks

  • There are currently no refbacks.