Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1837
| Title: | Improved algorithm for maximizing service of carousel storage | Authors: | Li, CL Wan, G |
Issue Date: | Aug-2005 | Source: | Computers and operations research, Aug. 2005, v. 32, no. 8, p. 2147-2150 | 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(j²). In this article, we present an algorithm with an improved complexity of O(j log j). | Keywords: | Carousel storage Computational complexity |
Publisher: | Pergamon Press | Journal: | Computers and operations research | ISSN: | 0305-0548 | EISSN: | 1873-765X | DOI: | 10.1016/j.cor.2004.02.005 | Rights: | Computers & Operations Research © 2004 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com. |
| Appears in Collections: | Journal/Magazine Article |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 45 Final-Version.pdf | Pre-published version | 77.61 kB | Adobe PDF | View/Open |
Access
View full-text via PolyU eLinks 
Page views
100
Last Week
0
0
Last month
Citations as of Apr 21, 2024
Downloads
162
Citations as of Apr 21, 2024
SCOPUSTM
Citations
2
Last Week
0
0
Last month
0
0
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
3
Last Week
0
0
Last month
0
0
Citations as of Apr 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.