DSpace JSPUI
DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets
Learn More
Please use this identifier to cite or link to this item:
https://repository.unej.ac.id/xmlui/handle/123456789/85435Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Ubaidillah, Firdaus | - |
| dc.contributor.advisor | Kamsyakawuni, Ahmad | - |
| dc.contributor.author | Setiawan, Bayu Arif | - |
| dc.date.accessioned | 2018-04-17T06:31:05Z | - |
| dc.date.available | 2018-04-17T06:31:05Z | - |
| dc.date.issued | 2018-04-17 | - |
| dc.identifier.nim | 001810101034 | - |
| dc.identifier.uri | http://repository.unej.ac.id/handle/123456789/85435 | - |
| dc.description.abstract | Dari hasil di atas dapat diketahui bahwa dengan menggunakan algoritma Tillman dan Cochran untuk data yang sama dapat memperkecil jumlah armada. Akan tetapi total jarak dengan algoritma tersebut jauh lebih besar daripada total jarak dengan algoritma Clarke dan Wright. | en_US |
| dc.language.iso | id | en_US |
| dc.subject | PROSES DISTRIBUSI BARANG | en_US |
| dc.subject | ALGORITMA TILLMAN | en_US |
| dc.subject | ALGORITMA COCHRAN | en_US |
| dc.title | OPTIMALISASI PROSES DISTRIBUSI BARANG BERDASARKAN ALGORITMA TILLMAN DAN COCHRAN | en_US |
| dc.type | Undergraduat Thesis | en_US |
| Appears in Collections: | UT-Faculty of Mathematics and Natural Sciences | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Bayu Arif Setiawan 001810101034.pdf | 9.08 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
Admin Tools