Abstract
This study investigates where an idle storage-retrieval device should dwell (locate) to minimise the expected response time of its next transaction for both an automated storage/retrieval system (AS/RS) and an automated storage carousel (ASC). A review of the relevant literature showed that previous attempts to obtain the dwell point location only considered a randomised storage assignment policy. This research proposes that under a myriad of operating conditions, the problem can be formulated as a p-median location problem on a tree network to incorporate the turnover-based storage assignment policy.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Industrial and Systems Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
