Maximizing service of carousel storage

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

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
Volume32
Issue number4
DOIs
Publication statusPublished - 2005 Apr 1

Fingerprint

heuristics
Optimal Solution
Heuristics
Polynomials
Polynomial time
Optimal solution
time

Keywords

  • Carousel storage problem
  • Optimal solution

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Applied Mathematics
  • Modelling and Simulation
  • Transportation

Cite this

Maximizing service of carousel storage. / Kim, Bara.

In: Computers and Operations Research, Vol. 32, No. 4, 01.04.2005, p. 767-772.

Research output: Contribution to journalArticle

@article{94d4bcebf05d4a32b35b4b067dac3679,
title = "Maximizing service of carousel storage",
abstract = "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.",
keywords = "Carousel storage problem, Optimal solution",
author = "Bara Kim",
year = "2005",
month = "4",
day = "1",
doi = "10.1016/j.cor.2003.08.016",
language = "English",
volume = "32",
pages = "767--772",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "4",

}

TY - JOUR

T1 - Maximizing service of carousel storage

AU - Kim, Bara

PY - 2005/4/1

Y1 - 2005/4/1

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

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

KW - Carousel storage problem

KW - Optimal solution

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

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

U2 - 10.1016/j.cor.2003.08.016

DO - 10.1016/j.cor.2003.08.016

M3 - Article

VL - 32

SP - 767

EP - 772

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

IS - 4

ER -