A simple heuristic for maximizing service of carousel storage

被引：21

作者：

Jacobs, DP

Peck, JC

Davis, JS ^{[1
]}

机构：

[1] Clemson Univ, Dept Management, Clemson, SC 29634 USA

[2] Clemson Univ, Dept Comp Sci, Clemson, SC 29634 USA

来源：

COMPUTERS & OPERATIONS RESEARCH | 2000年 / 27卷 / 13期

关键词：

carousel storage; heuristic;

D O I：

10.1016/S0305-0548(99)00089-1

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

We consider a system that stores cases of items. Items are removed from storage in groups. A group consists of a certain number of items of each type. The (integer maximization) problem is to determine how many cases of each type should be stored in order to maximize the number of groups of items that can be retrieved without re-loading. We give a simple heuristic that yields a feasible solution whose error can be bounded. Our method takes only linear time.

引用

页码：1351 / 1356

页数：6

共 6 条

[1] [Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[2] BROOKMAN F, 1997, STORES, V79, P74
[3] Sequencing methods for automated storage and retrieval systems with dedicated storage
Lee, HF
Schaefer, SK
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 1997, 32 (02) : 351 - 362
[4] Papadimitriou Christos H., 1981, Combinatorial Optimization: Algorithms and Complexity
[5] TRUNK C, 1996, MAT HANDLING ENG, V51, P43
[6] WISNIA SE, 1997, IND DISTRIB, V86, P120

← 1 →