Recency-based storage assignment and warehouse configuration for recurrent demands

Authors:
Yon-Chun Chou;Yao-Hung Chen;Hui-Min Chen
Affiliations:
Institute of Industrial Engineering, National Taiwan University, Taipei, Taiwan, ROC and Department of Mechanical Engineering, National Taiwan University, Taipei, Taiwan, ROC;Department of Mechanical Engineering, National Taiwan University, Taipei, Taiwan, ROC;National Taiwan University Hospital, Taipei, Taiwan, ROC
Venue:
Computers and Industrial Engineering
Year:
2012

Citing 9
Cited 0

Shared storage policies based on the duration stay of unit loads

Management Science
The forward-reserve problem

Optimization in industry 2
Data block prefetching and caching in a hierarchical storage model

Information Sciences—Applications: An International Journal
Hierarchical data placement for navigational multimedia applications

Data & Knowledge Engineering
Computer assisted customer churn management: State-of-the-art and future trends

Computers and Operations Research
Towards multipurpose autonomous manipulation with the uji service robot

Robotica
Simulation modelling and analysis of part and tool flow control decisions in a flexible manufacturing system

Robotics and Computer-Integrated Manufacturing
A study of storage assignment problem for an order picking line in a pick-and-pass warehousing system

Computers and Industrial Engineering
Mathematical modeling and solving procedure of the planar storage location assignment problem

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Storage assignment is an important decision problem in warehouse operation management. In conventional problem settings of distribution warehouses, stock items are stored in bulk but retrieved in small quantities. Storage assignment methods typically make use of demand attribute information of order quantity, order frequency and correlation between demands. In this paper, we address a different problem in which the request for the same stock items is stochastically recurrent. The problem arises when the items are needed in production and, after production, are returned to warehouses for later reuse. Examples of such items include tooling in factory, books in library and digital objects in data warehouses. Utilizing the recurrent characteristics, a salient recency-based storage assignment policy and an associated cascaded warehouse configuration are proposed and analyzed in this paper. This paper has four parts. In the first part, a model of recurrent demand is described. In the second part, the efficiency of the recency-based policy and a traditional ID-based policy is analyzed. In the third part, a mathematical programming model for optimal configuration of cascaded warehouses is presented. Finally, a case study of hospital visits is presented. This paper concludes with recommendations on cascading and zoning the warehouse for applying the recency-based policy.