Name
Abstract | ||
|---|---|---|
We consider a system that stores cases of items. Items are removed from storage in groups. A group consists of a certain number of items of each type. The (integer maximization) problem is to determine how many cases of each type should be stored in order to maximize the number of groups of items that can be retrieved without re-loading. We give a simple heuristic that yields a feasible solution whose error can be bounded. Our method takes only linear time. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0305-0548(99)00089-1 | Computers & OR |
Keywords | DocType | Volume |
carousel storage,simple heuristic | Journal | 27 |
Issue | ISSN | Citations |
13 | Computers and Operations Research | 9 |
PageRank | References | Authors |
2.42 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Pokrass Jacobs | 1 | 269 | 34.30 |
| John C. Peck | 2 | 9 | 4.79 |
| J. Steve Davis | 3 | 64 | 11.37 |