Improved algorithm for maximizing service of carousel storage

Chung-Lun Li; Guohua Wan

doi:10.1016/j.cor.2004.02.005

Improved algorithm for maximizing service of carousel storage

Chung-Lun Li, Guohua Wan

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

2 Citations (Scopus)

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). © 2004 Elsevier Ltd. All rights reserved.

Original language	English
Pages (from-to)	2147-2150
Journal	Computers and Operations Research
Volume	32
Issue number	8
DOIs	https://doi.org/10.1016/j.cor.2004.02.005
Publication status	Published - Aug 2005
Externally published	Yes

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Research Keywords

Carousel storage
Computational complexity

Access Output

10.1016/j.cor.2004.02.005

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{b176c0c522cc4004a2655f75e4af4c77,

title = "Improved algorithm for maximizing service of carousel storage",

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 O(j log j). {\textcopyright} 2004 Elsevier Ltd. All rights reserved.",

keywords = "Carousel storage, Computational complexity",

author = "Chung-Lun Li and Guohua Wan",

note = "Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].",

year = "2005",

month = aug,

doi = "10.1016/j.cor.2004.02.005",

language = "English",

volume = "32",

pages = "2147--2150",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd.",

number = "8",

}

TY - JOUR

T1 - Improved algorithm for maximizing service of carousel storage

AU - Li, Chung-Lun

AU - Wan, Guohua

N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

PY - 2005/8

Y1 - 2005/8

N2 - 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 O(j log j). © 2004 Elsevier Ltd. All rights reserved.

AB - 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 O(j log j). © 2004 Elsevier Ltd. All rights reserved.

KW - Carousel storage

KW - Computational complexity

UR - http://www.scopus.com/inward/record.url?scp=10644290236&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-10644290236&origin=recordpage

U2 - 10.1016/j.cor.2004.02.005

DO - 10.1016/j.cor.2004.02.005

M3 - RGC 21 - Publication in refereed journal

SN - 0305-0548

VL - 32

SP - 2147

EP - 2150

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 8

ER -

Improved algorithm for maximizing service of carousel storage

Abstract

Bibliographical note

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this