Abstract
A new shuffling heuristic-based approach that combines the random storage and class-based storage assignments is proposed for the storage location assignment in an automated storage retrieval system. In this paper we describe the shuffling algorithms developed and show that the waiting time and service time reduced considerably for this storage policy. The efficiency and validity of the algorithm are illustrated through computer simulation.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
