INCREASING WAREHOUSE THROUGHPUT THROUGH THE DEVELOPMENT OF A DYNAMIC CLASS-BASED STORAGE ASSIGNMENT ALGORITHM

Sara Elizabeth McInerney, Sarma Yadavalli

Abstract


This study investigates the problems faced by an agricultural wholesaler arising from an inefficient random storage assignment policy. Research was conducted on warehouse operations and storage policies. The ABC classification technique was used to create a class-based storage assignment policy. This policy was then input into an algorithm that packs products according to how frequently they are ordered. The aim of the algorithm is to store fast-moving products closest to the shipping area. If this is done, the order picking times would decrease by an average of 3 hours 20 mins per day. This would increase the warehouse’s throughput and profitability.

Keywords


Storage policy; SLAP; Inventory Management

Full Text:

PDF


DOI: https://doi.org/10.7166/33-2-2651

Refbacks

  • There are currently no refbacks.




Copyright (c) 2022 Sarma Yadavalli, Sara Elizabeth McInerney


ISSN 2224-7890 (on-line)


Powered by OJS and hosted by Stellenbosch University Library and Information Service since 2011.


Disclaimer:

This journal is hosted by the SU LIS on request of the journal owner/editor. The SU LIS takes no responsibility for the content published within this journal, and disclaim all liability arising out of the use of or inability to use the information contained herein. We assume no responsibility, and shall not be liable for any breaches of agreement with other publishers/hosts.

SUNJournals Help