| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 474364 | Computers & Operations Research | 2005 | 4 Pages |
Abstract
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 (Comput. Oper. Res., forthcoming) has developed an algorithm for solving this problem with a running time of O(j2). In this article, we present an algorithm with an improved complexity of .
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Chung-Lun Li, Guohua Wan,