Maximizing service of carousel storage

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


Jacobs et al. considered the problem on maximizing service of carousel storage and gave heuristics for the problem. Yeh improved the heuristics of Jacobs et al. We show that Yeh's approach does not always lead to the optimal solution, and then give an algorithm finding the optimal solution by modifying Yeh's approach. Our algorithm for the optimal solution is shown to be completed in polynomial time.

Original languageEnglish
Pages (from-to)767-772
Number of pages6
JournalComputers and Operations Research
Issue number4
Publication statusPublished - 2005 Apr

Bibliographical note

Funding Information:
This work was supported by the Post-doctoral Fellowship Program of Korea Science & Engineering Foundation (KOSEF).


  • Carousel storage problem
  • Optimal solution

ASJC Scopus subject areas

  • General Computer Science
  • Modelling and Simulation
  • Management Science and Operations Research


Dive into the research topics of 'Maximizing service of carousel storage'. Together they form a unique fingerprint.

Cite this