Improved algorithm for maximizing service of carousel storage

Authors:
Chung-Lun Li;Guohua Wan
Affiliations:
Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Faculty of Business Administration, University of Macao, Taipa, Macao,China
Venue:
Computers and Operations Research
Year:
2005

Citing 4
Cited 0

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
A simple heuristic for maximizing service of carousel storage

Computers and Operations Research
A note on "a simple heuristic for maximizing service of carousel storage"

Computers and Operations Research
Maximizing service of carousel storage

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

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