Maximizing service of carousel storage

Bara Kim

doi:10.1016/j.cor.2003.08.016

Maximizing service of carousel storage

Bara Kim

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	767-772
Number of pages	6
Journal	Computers and Operations Research
Volume	32
Issue number	4
DOIs	https://doi.org/10.1016/j.cor.2003.08.016
Publication status	Published - 2005 Apr

Bibliographical note

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

Keywords

Carousel storage problem
Optimal solution

ASJC Scopus subject areas

General Computer Science
Modelling and Simulation
Management Science and Operations Research

Access to Document

10.1016/j.cor.2003.08.016

Cite this

@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",

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

year = "2005",

month = apr,

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 Ltd",

number = "4",

}

TY - JOUR

T1 - Maximizing service of carousel storage

AU - Kim, Bara

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

PY - 2005/4

Y1 - 2005/4

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

U2 - 10.1016/j.cor.2003.08.016

DO - 10.1016/j.cor.2003.08.016

M3 - Article

AN - SCOPUS:5644304567

SN - 0305-0548

VL - 32

SP - 767

EP - 772

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 4

ER -

Maximizing service of carousel storage

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this