Storage Location Assignment and I/O Location Design on Storage Planning

Storage Location Assignment and I/O Location Design on Storage Planning

Michael H. Hu (Yuan Ze University, Taoyuan, Taiwan), Mu-Chung Chen (Yuan Ze University, Taoyuan, Taiwan) and Meei-Yuh Ku (National Chin-Yi University of Technology, T, Taiwan)
DOI: 10.4018/IJISSCM.2016100103
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

The purpose of this research was to investigate the relationships with storage location assignment and location of I/O points in details in the warehouse operation planning. Dedicated storage warehouse design and three different allocation methods (throughput-to-storage ratios, space-filling curve with X and Y type) were studied using the simulated annealing method. The computer program was implemented with the Access software by Microsoft. The result shows that cost of the storage method of throughput-to-storage ratios can achieve the lowest cost, and then the space-filling curve with X and Y type. However, the storage method of throughput-to-storage ratios may result in the discontinuity of the storage locations.
Article Preview

Literature Review

Effective storage planning has become a potentially valuable way of competitive advantage and improving organizational performance. Warehouse storage planning involves determining storage location assignment policies and storage location assignment methods (Muppani & Adil, 2008a). Storage policies related to decide how to allocate the various storage locations of a uniform storage medium to a number of SKU’s (Malmborg, 1998). The storage location assignment problem involves the placement of a set of items in a warehouse in such a way that some performance measure is optimal (Kovács, 2011). In this section, we present storage policies and describe the most important storage location assignment methods.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 10: 4 Issues (2017)
Volume 9: 4 Issues (2016)
Volume 8: 4 Issues (2015)
Volume 7: 4 Issues (2014)
Volume 6: 4 Issues (2013)
Volume 5: 4 Issues (2012)
Volume 4: 4 Issues (2011)
Volume 3: 4 Issues (2010)
Volume 2: 4 Issues (2009)
Volume 1: 4 Issues (2008)
View Complete Journal Contents Listing