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
Maximizing service of carousel storage
Computers and Operations Research
Storage space allocation to maximize inter-replenishment times
Computers and Operations Research
Hi-index | 0.01 |
We consider the same carousel storage system as that given by Jacobs et al. We propose a different but simpler approach for the solution, in which the solution is obtained by solving a linear equation. We also propose a simple heuristic that appears to give a feasible solution with more accuracy compared to that of Jacobs et al. Only linear computation time is needed.