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
Keywords: Carousel storage
Computational complexity
Issue Date: Aug-2005
Publisher: Elsevier
Source: Computers & operations research, Aug. 2005, v. 32, no. 8, p. 2147-2150 How to cite?
Journal: Computers & Operations Research 
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).
URI: http://hdl.handle.net/10397/1837
ISSN: 0305-0548
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 SizeFormat 
45 Final-Version.pdfPre-published version77.61 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

1
Last Week
0
Last month
0
Citations as of Jun 4, 2016

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
0
Citations as of Aug 25, 2016

Page view(s)

277
Last Week
0
Last month
Checked on Aug 21, 2016

Download(s)

159
Checked on Aug 21, 2016

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.