Jacobs et al. considered the problem on maximizing service of carousel storage and gave heuristics for 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.
- Carousel storage problem
- Optimal solution
ASJC Scopus subject areas
- Information Systems and Management
- Management Science and Operations Research
- Applied Mathematics
- Modelling and Simulation