Abstract
An essential element of warehouse work which can be optimised is order-picking time. It can be minimised by determining the shortest picker's route and the appropriate storage location assignment of items. In this paper only one-block rectangular warehouses with picker-to-part order picking systems are considered. The warehouse processes are presented. The routing heuristics and the optimal algorithm and storage location assignment methods are described. Against this background the original dedicated storage location assignment algorithms are presented. The efficiency of the methods is verified using simulations. For the calculations the original software Warehouse Real-Time Simulator is used.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
