| Article ID: | iaor20031880 |
| Country: | United Kingdom |
| Volume: | 30 |
| Issue: | 4 |
| Start Page Number: | 527 |
| End Page Number: | 539 |
| Publication Date: | Apr 2003 |
| Journal: | Computers and Operations Research |
| Authors: | Vickson Raymond G., Hassini Elkafi |
| Keywords: | location, heuristics |
We describe a problem of storing products in carousels that are grouped in pods of two. Each pod is served by one operator. The aim is to minimize the long-run average rotational time per retrieval operation. We formulate the problem as a new type of nonlinear partitioning problem and discuss several heuristic solution procedures.