Permana, Muhammad Iqbal Andian (2018) Perbandingan Metode Zero Suffix dan Metode MDMA (Maximum Divide Minimum Allotment) untuk menyelesaikan masalah transportasi. Diploma thesis, UIN Sunan Gunung Djati Bandung.
|
Text (COVER)
1_cover.pdf Download (209kB) | Preview |
|
|
Text (ABSTRAK)
2_abstrak.pdf Download (199kB) | Preview |
|
|
Text (DAFTAR ISI)
3_daftarisi.pdf Download (199kB) | Preview |
|
|
Text (BAB I)
4_bab1.pdf Download (491kB) | Preview |
|
Text (BAB II)
5_bab2.pdf Restricted to Registered users only Download (2MB) | Request a copy |
||
Text (BAB III)
6_bab3.pdf Restricted to Registered users only Download (549kB) | Request a copy |
||
Text (BAB IV)
7_bab4.pdf Restricted to Registered users only Download (1MB) | Request a copy |
||
Text (BAB V)
8_bab5.pdf Restricted to Registered users only Download (217kB) | Request a copy |
||
Text (DAFTAR PUSTAKA)
9_daftarpustaka.pdf Restricted to Registered users only Download (198kB) | Request a copy |
Abstract
INDONESIA Penelitian ini membahas tentang membandingkan solusi optimal untuk menyelesaikan masalah transportasi menggunakan Metode Zero Suffix dan Metode Maximum Divide Minimum Allotment (MDMA). Metode Zero Suffix ini menentukan nilai minimum pada setiap baris dan kolom kemudian biaya produksinya dikurangi dengan nilai minimum dari baris dan kolom tersebut. Selanjutnya cari suffix value untuk menentukan pengalokasian pertama. Sedangkan Metode MDMA menentukan nilai terbesar pada tabel transportasi, kemudian tiap entri biaya di bagi dengan nilai terbesar tersebut. Selanjutnya pilih hasil paling minimum untuk pengalokasian pertama. Setelah mengaplikasikan Metode Zero Suffix dan Metode MDMA pada objek penelitian kemudian dibandingkan solusi optimalnya. Setelah dibandingkan ternyata Metode Zero Suffix lebih optimal, karena biaya distribusinya lebih minimum. ENGLISH This study discusses comparing optimal solutions to solve transportation problems using the Zero Suffix Method and the Maximum Divide Minimum Allotment (MDMA) Method. Zero Suffix method determines the minimum value for each row and column then the production cost is reduced by the minimum value of the row and column. Then find the suffix value to determine the first allocation. MDMA method determines the maximum value in the transportation table, then each cost entry is divided by the maximum value. Then select the minimum value for the first allocation. After applying the Zero Suffix Method and the MDMA Method, the object of the study then compared to the optimal solution. The Zero Suffix method is more optimal, because the distribution costs are more minimum
Item Type: | Thesis (Diploma) |
---|---|
Uncontrolled Keywords: | Masalah transportasi; Solusi Optimal; Metode Zero Suffix; Metode MDMA; |
Subjects: | Mathematics > Research Methods of Mathematics |
Divisions: | Fakultas Sains dan Teknologi > Program Studi Matematika |
Depositing User: | Muhammad Iqbal Andian Permana |
Date Deposited: | 25 Jan 2019 06:55 |
Last Modified: | 25 Jan 2019 06:55 |
URI: | https://digilib.uinsgd.ac.id/id/eprint/18309 |
Actions (login required)
View Item |