| Article ID: | iaor20112477 |
| Volume: | 47 |
| Issue: | 2 |
| Start Page Number: | 81 |
| End Page Number: | 92 |
| Publication Date: | Feb 2010 |
| Journal: | INFOR: Information Systems and Operational Research |
| Authors: | Hassini Elkafi |
| Keywords: | combinatorial optimization |
In this paper we focus on the problems of one‐dimensional storage location and order picking in a single carousel. We illustrate several applications, review the literature and list some open problems, and present a general model that includes the one‐dimensional carousel storage location problem as well as other well‐known combinatorial optimization problems as special cases.