Minimizing warehouse handling cost using combined class-based and closest open location storage policy (a case study at warehouse xyz) / Tracy Adeline Ajol

• Main Author: Ajol, Tracy Adeline
• Format: Thesis
• Language: English
• Published: 2014
• Online Access: https://ir.uitm.edu.my/id/eprint/16465/1/TM_TRACY%20ADELINE%20AJOL%20CS%2014_5.pdf; https://ir.uitm.edu.my/id/eprint/16465/

Storage Location Assignment Problems (SLAP) is one of the main concerns in many warehouse management researches. This is because, the decision on storage policy implemented by a warehouse will highly affect its profit. The main problem faced by a warehouse researcher is to determine the most profitable storage strategy where it concerns with the assignment of incoming products to storage locations in storage departments. Failure to solve the storage location assignment problems will not only affect the high operating cost in warehouse but also reduce the efficiency of operation flow in a warehouse. Hence, the objective of this study is to minimize total handling cost using class based storage policy by considering assignment of every incoming product based on closest open location policy each class. Criteria used to assigned a product to each class are based on its popularity. A mixed integer programming model Class Based Storage Location Assignment with Closest Open Location (CB COL) is proposed to minimize the storage total travel distance, thus minimize total handling cost. The model also considers the number of levels at each storage location for storage of unit load (pallet) and the model is solved using Microsoft Excel Adds-In Solver. Computational experiment using one-month collected data from warehouse XYZ is based on 12 storage locations with the implementation of three classes. The results show that the proposed model (CB_COL) contribute in small amount of in total handling cost as compared to the classical class based storage location assignment policy with random open location (CB RAN).