Increasing warehouse throughput through the development of a dynamic class-based storage assignment algorithm

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.

Hierdie studie ondersoek die probleme ervaar deur ’n landbou groothandelaar as gevolg van ’n ondoeltreffende toevaksgebaseerde stoorbeleid. Navorsing is gedoen oor pakhuisbedrywighede en stoorbeleide. Die ABC-klassifikasie tegniek is gebruik om ’n klasgebaseerde stoorbeleid op te stel. Hierdie beleid is toe ingevoer in ’n algoritme wat produkte verpak volgens hoe gereeld die produkte bestel word. Die doel van die algoritme is om produkte wat vinnig beweeg naaste aan die versendingsarea te stoor. As dit gedoen word, sal die bestellingopteltye verminder met ’n gemiddelde tyd van 3 ure en 20 minute per dag. Dit sal die deurset en winsgewendheid van die pakhuis verhoog.