Maximizing service of carousel storage

摘要

Jacobs et al. considered the problem on maximizing service of carousel storage and gave heuristics tor the problem. Yeh improved the heuristics of Jacobs et al. We show that Yeh's approach does not always lead to the optimal solution, and then give an algorithm finding the optimal solution by modifying Yeh's approach. Our algorithm for the optimal solution is shown to be completed in polynomial time.