Abstract

Abstract The selection of the dwell point of the storage/retrieval (S/R) machine when it becomes idle in an automated storage/retrieval system (AS/RS) is discussed. Two existing models for dynamic control of the S/R machine are adopted for the analysis. They are transformed to the single-facility location problem with Tchebyshev distance, and the Tchebyshev minimax facility location problem, respectively. Algorithms are presented utilizing well known research results in location theory. Through computational tests, the algorithms are shown to be quite suitable for real-world applications.

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