dc.contributor.advisor | Manurung, Asima | |
dc.contributor.author | Nainggolan, Kerin Gibson | |
dc.date.accessioned | 2024-09-11T09:19:16Z | |
dc.date.available | 2024-09-11T09:19:16Z | |
dc.date.issued | 2024 | |
dc.identifier.uri | https://repositori.usu.ac.id/handle/123456789/97165 | |
dc.description.abstract | Transportation problem is a method that studies the problem of distributing goods from several supplier sources to several destination points by minimising distribution costs. Transport methods are ways to solve transport problems. There are various methods used in solving transport problems. One of them is the ASM method (Abdul, Shakeel, M.Khalid) which is one of the direct solution methods without finding the initial solution value. The ASM method was introduced in 2012 by Abdul Quddoos, Shakeel Javaid and M. M. Khalid which was then modified again in 2016 to improve this method and obtain optimal results on unbalanced transportation. The ASM method has characteristics that focus on the cost of the reduced row and column costs that are 0. This method is used to optimise distribution costs at Perum BULOG Medan Branch. In this paper, the method can save the transportation cost of distributing premium rice ‘Beraskita’ at Perum BULOG Medan Branch Office by 8,44% or Rp7.684.930 for year 2023. | en_US |
dc.language.iso | id | en_US |
dc.publisher | Universitas Sumatera Utara | en_US |
dc.subject | Abdul Shakeel M.Khalid (ASM) Methodproblem | en_US |
dc.subject | Perum BULOG Cabang Medan | en_US |
dc.subject | Transportation | en_US |
dc.subject | SDGs | en_US |
dc.title | Analisis Metode Abdul Shakeel M.Khalid (ASM) dalam Pemecahan Masalah Transportasi pada Perum Bulog Cabang Medan | en_US |
dc.title.alternative | Analysis of Abdul Shakeel M.Khalid (ASM) Method in Solving Transportation Problems at Perum Bulog Cabang Medan | en_US |
dc.type | Thesis | en_US |
dc.identifier.nim | NIM200803114 | |
dc.identifier.nidn | NIDN0015037310 | |
dc.identifier.kodeprodi | KODEPRODI44201#Matematika | |
dc.description.pages | 53 Pages | en_US |
dc.description.type | Skripsi Sarjana | en_US |