Improved algorithm for maximizing service of carousel storage

Chung Lun Li, Guohua Wan

Research output: Journal article publicationJournal articleAcademic researchpeer-review

2 Citations (Scopus)


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 languageEnglish
Pages (from-to)2147-2150
Number of pages4
JournalComputers and Operations Research
Issue number8
Publication statusPublished - 1 Aug 2005


  • Carousel storage
  • Computational complexity

ASJC Scopus subject areas

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research


Dive into the research topics of 'Improved algorithm for maximizing service of carousel storage'. Together they form a unique fingerprint.

Cite this