Rancangan Tata Letak Area Penempatan Obat di Gudang Menggunakan Metode Algoritma K-Means Dan Association Rule

Abstract

Warehouse is needed as a storage place for drugs to maintain the quality of drugs in good condition. The problem found in the warehouse of the UPT XYZ was the absence of drug grouping and information on the presence of drugs in the warehouse and the narrow aisles of the shelves. The purpose of this study was to obtain an optimal drug placement area layout design. The layout design of the drug placement area begins by grouping the drugs into 3 clusters, namely fast, slow, and non-moving using the K-Means algorithm method. Fast moving drugs are placed close to the delivery area, slow moving drugs are placed next to or behind fast moving drugs and non moving drugs are placed next to or behind slow moving drugs which are farthest from the delivery area. After that, identification of associative relationships between drugs was carried out in the request data using the Association Rule method which produced 9 valid rules. After the design is complete, then the codefication design and drug storage information system is carried out. The results showed that the drug placement area layout design was more optimal because it reduced the distance by 7.27%