Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1837
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorLi, CL-
dc.creatorWan, G-
dc.date.accessioned2014-12-11T08:25:29Z-
dc.date.available2014-12-11T08:25:29Z-
dc.identifier.issn0305-0548-
dc.identifier.urihttp://hdl.handle.net/10397/1837-
dc.language.isoenen_US
dc.publisherPergamon Pressen_US
dc.rightsComputers & Operations Research © 2004 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com.en_US
dc.subjectCarousel storageen_US
dc.subjectComputational complexityen_US
dc.titleImproved algorithm for maximizing service of carousel storageen_US
dc.typeJournal/Magazine Articleen_US
dc.description.otherinformationDepartment of Logisticsen_US
dc.identifier.spage2147-
dc.identifier.epage2150-
dc.identifier.volume32-
dc.identifier.issue8-
dc.identifier.doi10.1016/j.cor.2004.02.005-
dcterms.abstractWe 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).-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationComputers and operations research, Aug. 2005, v. 32, no. 8, p. 2147-2150-
dcterms.isPartOfComputers and operations research-
dcterms.issued2005-08-
dc.identifier.isiWOS:000227210000013-
dc.identifier.scopus2-s2.0-10644290236-
dc.identifier.eissn1873-765X-
dc.identifier.rosgroupidr29094-
dc.description.ros2005-2006 > Academic research: refereed > Publication in refereed journal-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
45 Final-Version.pdfPre-published version77.61 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

154
Last Week
0
Last month
Citations as of Aug 13, 2025

Downloads

210
Citations as of Aug 13, 2025

SCOPUSTM   
Citations

2
Last Week
0
Last month
0
Citations as of Sep 12, 2025

WEB OF SCIENCETM
Citations

3
Last Week
0
Last month
0
Citations as of Dec 18, 2025

Google ScholarTM

Check

Altmetric


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