USULAN PERBAIKAN TATA LETAK PENYIMPANAN GUDANG BARANG ATK BERDASARKAN KEBIJAKAN DEDICATED STORAGE DENGAN MENGGUNAKAN ALGORITMA GREEDY DI KANTOR POS ASIA AFRIKA BANDUNG

  • Septiona Septiona Universitas Logistik dan Bisnis Internsional
  • Erna Mulyati Universitas Logistik dan Bisnis Internsional
  • Agus Purnomo Universitas Logistik dan Bisnis Internsional

Abstract

Efficient storage in a stationery warehouse plays an important role in ensuring the availability and accessibility of products needed. A non-optimal arrangement in warehouse storage can result in wasted time due to slow search for items and lack of space for new items. This article discusses the proposed improvement of the storage layout of the stationery warehouse based on the "Dedicated Storage" policy with the application of the Greedy algorithm. The "Dedicated Storage" policy refers to the concept of allocating fixed storage locations for specific groups of goods. In this proposal, the Greedy algorithm is used to design a more efficient warehouse storage layout. The Greedy algorithm prioritizes decision-making based on the best local criteria at each step, in the hope of achieving an adequate global solution. In this context, the Greedy algorithm is applied to determine the optimal storage location based on the Dedicated Storage policy. The steps taken in this research include: (1). Data collection of stationery items to be stored, including attributes such as size, frequency of demand, and category. (2). Formation of groups of goods based on certain categories or attributes. (3). Application of the Greedy algorithm to determine the optimal storage location for each group of goods. And (4). Evaluation of the performance of the new layout based on parameters such as item search time and space utilization efficiency.  The results of this study are expected to provide practical guidance for improving the storage layout of the stationery warehouse. By adopting the Dedicated Storage policy and utilizing the Greedy algorithm, it is expected that the warehouse will have a more structured and efficient layout. This can reduce search time, increase productivity, and optimize space usage. In addition, this proposed concept can also be adapted in the context of storing goods in various types of warehouses or other storage facilities.
 
Keywords: Improvement Proposal, Warehouse Layout, Storage Management, Dedicated Storage Policy.

References

Apple, J. (1990). Tata Letak Pabrik dan Pemindahan Bahan. Bandung: ITB
Heragu, Sunderesh S. (2016). Facilities Design Fourth Edition. Boca Raton: CRC Press
Martono, Ricky. (2018). Manajemen Logistik. Jakarta: PT Gramedia Pustaka Utama
Purnomo, H. (2004). Perencanaan dan Perancangan Fasilitas. Jakarta: Graha Ilmu
Sabo, Aleksandra. (2012). Optimization of Deployment of Goods Supply in a High Storage Supply in a High Storage Warehouse by Means of the Greedy Algorithm. Journal of Mathematical Economics. No. 8 (15)
Talbi, El Ghazali. (2009). Metaheuristics: From Design to Implementation. Hoboken: John Wiley & Sons, Inc
Tiga Permata Logistik, PT. (2019). Manajemen Pergudangan Logistik. [Online]. Tersedia pada website https://www.3pl.co.id/manajemen-pergudangan-logistik/. Diakses pada 30 Mei 2021
Uma, V., Lin , E., Jayashree, D. (2016). Efficient Storage Location Assignment Using Genetic Algorithm in Warehouse Management System. Journal of Advanced Research. Vol 4, Issue 6, 18-24
Wisittipanich, W., & Kasemset, C. (2015). Metaheuristics for Warehouse Storage Location Assignment Problems. Journal of CMUJ NS Special Issue on Logistics and Supply Chain Systems. Vol 14 (4)
Yolanda, M. S. (2005). Aplikasi Supply Chain Management dalam Dunia Bisnis. Jakarta: Gramedia Widiasarana Indonesia
Published
2023-12-01
How to Cite
SEPTIONA, Septiona; MULYATI, Erna; PURNOMO, Agus. USULAN PERBAIKAN TATA LETAK PENYIMPANAN GUDANG BARANG ATK BERDASARKAN KEBIJAKAN DEDICATED STORAGE DENGAN MENGGUNAKAN ALGORITMA GREEDY DI KANTOR POS ASIA AFRIKA BANDUNG. JURNAL ADMINISTRASI KANTOR, [S.l.], v. 11, n. 2, p. 24-50, dec. 2023. ISSN 2527-9769. Available at: <https://460290.0x60nl4us.asia/index.php/JAK/article/view/2568>. Date accessed: 28 nov. 2024. doi: https://doi.org/10.51211/jak.v11i2.2568.