### Abstract

A carousel is an automated storage and retrieval system which consists of a circular disk with a large number of shelves and drawers along its circumference. The disk can rotate either direction past a picker who has a list of items that have to be collected from $n$ different drawers. In this paper, we assume that locations of the $n$ items are independent and have a continous non-uniform distribution over the carousel circumference. For this model, we determine a limiting behavior of the shortest rotation time needed to collect one large order. In particular, our limiting result indicates that if an order is large, then it is optimal to allocate {\it less} frequently asked items {\it close} to the picker's starting position. This is in contrast with picking of small orders where the optimal allocation rule is clearly the opposite. We also discuss travel times and allocation issues for optimal picking of sequential orders.

Original language | Undefined |
---|---|

Place of Publication | Enschede |

Publisher | University of Twente, Department of Applied Mathematics |

Number of pages | 16 |

Publication status | Published - 2004 |

### Publication series

Name | Memorandum Faculty of Mathematical Sciences |
---|---|

Publisher | University of Twente, Department of Applied Mathematics |

No. | 1736 |

ISSN (Print) | 0169-2690 |

### Keywords

- MSC-62E15
- MSC-90B80
- MSC-90B06
- IR-65920
- MSC-60J20
- EWI-3556
- METIS-218606
- MSC-60F05

## Cite this

Litvak, N. (2004).

*Optimal picking of large orders in carousel systems*. (Memorandum Faculty of Mathematical Sciences; No. 1736). Enschede: University of Twente, Department of Applied Mathematics.