Research on the directional replenishment operation problem in distribution center

Author

Wang Xiong-zhi ; Wang Guo-Qing

Author_Institution

Coll. of Econ. & Manage., South China Agric. Univ., Guangzhou, China

fYear

2009

fDate

6-9 July 2009

Firstpage

268

Lastpage

272

Abstract

There are lots of operations in the distribution center, of which the replenishment operation is an important one that can decrease the processing time seriously and bring considerable economic benefit if managed effectively. We consider the replenishment problem in which travel time and distance is measured according to rectilinear norm. An O(n) polynomial time algorithm to find the optimal replenishing sequence is given. And the algorithm procedure is shown through one computational experiment.

Keywords

computational complexity; distribution strategy; graph theory; integer programming; linear programming; minimisation; order picking; directional replenishment operation problem; distance measurement; distribution center; graph theory; integer linear programming; minimization; optimal replenishing sequence; order picking; polynomial time algorithm; rectilinear norm; travel time measurement; warehouse; Agriculture; Area measurement; Bulk storage; Costs; Mathematical model; Operations research; Personnel; Polynomials; Productivity; Time measurement; Algorithm; Distribution Center; Operations Research; Replenishment Operation;

fLanguage

English

Publisher

ieee

Conference_Titel

Computers & Industrial Engineering, 2009. CIE 2009. International Conference on

Conference_Location

Troyes

Print_ISBN

978-1-4244-4135-8

Electronic_ISBN

978-1-4244-4136-5

Type

conf

DOI

10.1109/ICCIE.2009.5223509

Filename

5223509