Roby, Agus Maolana (2022) Analisis metode VAM dan metode Zero Suffix pada masalah penugasan. Sarjana thesis, UIN Sunan Gunung Djati Bandung.
|
Text (COVER)
1_cover.pdf Download (49kB) | Preview |
|
|
Text
2_abstrak (1).pdf Download (429kB) | Preview |
|
|
Text
3_daftarisi.pdf Download (597kB) | Preview |
|
|
Text
4_bab1 (2).pdf Download (770kB) | Preview |
|
Text
5_bab2.pdf Restricted to Registered users only Download (889kB) | Request a copy |
||
Text
6_bab3.pdf Restricted to Registered users only Download (1MB) | Request a copy |
||
Text
7_bab4.pdf Restricted to Registered users only Download (5MB) | Request a copy |
||
Text
8_bab5 (1).pdf Restricted to Registered users only Download (323kB) | Request a copy |
||
Text
9_daftarpustaka (2).pdf Restricted to Registered users only Download (444kB) | Request a copy |
Abstract
INDONESIA : Penelitian ini membahas tentang masalah penugasan kasus minimasi seimbang dengan Metode VAM maupun Metode Zero Suffix. Metode VAM merupakan metode baru dengan cara menentukan nilai pinalti pada setiap baris dan kolom. Sedangkan metode Zero Suffix menentukan nilai suffix value (S) pada setiap baris dan kolom. Kedua metode ini diaplikasikan pada 150 data random dengan nilai range berbeda. Perbandingan hasil solusi optimal masalah penugasan Metode VAM yang sama dengan metode Zero Suffix sebanyak 28 data. Metode VAM memberikan solusi optimal sebanyak 103 data, sedangkan Metode Zero Suffix memberikan solusi optimal sebanyak 19 data. Sehingga dapat disimpulkan bahwa metode VAM dinilai lebih baik daripada metode Zero Suffix dalam menyelesaikan masalah penugasan untuk seluruh kasus yang telah dikaji. ENGLISH : This study discusses about the problem of assigning balanced minimization cases using the VAM method and the Zero Suffix method. The VAM method is a new method by determining the penalty value in each row and column. While the Zero Suffix Method determines the suffix value (S) in each row and column. These two methods were applied to 150 random data with different range values. Comparison of the results of the optimal solution to the assignment problem of the same VAM Method with the Zero Suffix Method as many as 28 data, The VAM method provides an optimal solution of 103 data, The Zero Suffix method provides an optimal solution of 19 data. So it can be concluded that the VAM method is considered better than the Zero Suffix Method in solving assignment problems for all cases that have been studied.
Item Type: | Thesis (Sarjana) |
---|---|
Uncontrolled Keywords: | Masalah Penugasan; Solusi Optimal; Minimasi; Metode VAM; Metode Zero Suffix; |
Subjects: | Applied mathematics > Mathematical Optimization Applied mathematics > Programming Mathematics Applied mathematics > Special Topics of Applied Mathematics |
Divisions: | Fakultas Sains dan Teknologi > Program Studi Matematika |
Depositing User: | Agus maolana roby |
Date Deposited: | 15 Sep 2022 00:48 |
Last Modified: | 15 Sep 2022 00:48 |
URI: | https://digilib.uinsgd.ac.id/id/eprint/56652 |
Actions (login required)
View Item |