Maximizing service of carousel storage

Authors:
Bara Kim
Affiliations:
Department of Mathematics and Telecommunication Mathematics Research Center, Korea University, Seoul, South Korea
Venue:
Computers and Operations Research
Year:
2005

Citing 2
Cited 2

A simple heuristic for maximizing service of carousel storage

Computers and Operations Research
A note on "a simple heuristic for maximizing service of carousel storage"

Computers and Operations Research

Improved algorithm for maximizing service of carousel storage

Computers and Operations Research
Storage space allocation to maximize inter-replenishment times

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.