An algorithm to assign storage areas of products for minimizing mean flow time of pick up trucks

Main Article Content

Supachai Pathumnakul, Ph.D.
Mr.Nattapol chaibenjapol
Mr.Withoon Arbsuwan
Miss Wipada Suwanapichon

Abstract

In this paper, the problem of minimizing mean flow time of pick up trucks is addressed. There is a set of trucks that queue in front of the loading dock of a warehouse waiting to load products. The products are stored in the loading area which is separated into a set of storage areas. All storage areas have equal space. Each storage area contains only a product. A material handling equipment (Forklift) is used to carry product from its storage place to the pick up truck. The objective of this paper is to assign the storage area of each product that minimizes the mean flow time of trucks. In this paper , the mathematical model is formulated and an algorithm is developed to solve some example problems. The results show that the developed algorithm gives solutions that close to the optimal solutions from mathematical model.

Article Details

How to Cite
Pathumnakul, Ph.D., S., chaibenjapol, M., Arbsuwan, M., & Suwanapichon, M. W. (2013). An algorithm to assign storage areas of products for minimizing mean flow time of pick up trucks. Engineering and Applied Science Research, 29(1-2), 147–160. Retrieved from https://ph01.tci-thaijo.org/index.php/easr/article/view/6531
Section
ORIGINAL RESEARCH