Abstract

This study investigates the optimal dwell point location of idle server within a multi–aisle automated storage and retrieval system. The objective function herein is to minimise the expected value of the next transaction time for the automated storage and retrieval system. After a brief review of the relevant literature on dwell point location, this research shows that the single server, multi–aisle dwell point location problem can be solved via an application of classical optimisation of a special class of Tchebychev expected distance functions.

Full Text
Published version (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