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 article publication › Journal article › Academic research › 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(j2). In this article, we present an algorithm with an improved complexity of O(j log j).

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

Keywords

Carousel storage
Computational complexity

ASJC Scopus subject areas

General Computer Science
Modelling and Simulation
Management Science and Operations Research

More information

10.1016/j.cor.2004.02.005

http://hdl.handle.net/10397/1837

Cite this

@article{cdb59a8a48b84963ac14011e4923a440,

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).",

keywords = "Carousel storage, Computational complexity",

author = "Li, {Chung Lun} and Guohua Wan",

year = "2005",

month = aug,

day = "1",

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

PY - 2005/8/1

Y1 - 2005/8/1

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).

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).

KW - Carousel storage

KW - Computational complexity

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

U2 - 10.1016/j.cor.2004.02.005

DO - 10.1016/j.cor.2004.02.005

M3 - Journal article

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

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this