| Article ID: | iaor2006813 |
| Country: | United Kingdom |
| Volume: | 32 |
| Issue: | 8 |
| Start Page Number: | 2147 |
| End Page Number: | 2150 |
| Publication Date: | Aug 2005 |
| Journal: | Computers and Operations Research |
| Authors: | Li Chung-Lun, Wan Guohua |
| Keywords: | service, combinatorial analysis |
We consider a problem of maximizing the service of a carousel storage system from which items are removed in groups, where each group consists of a certain given number of items of each type. Kim has developed an algorithm for solving this problem with a running time of