Optimal storage assignment policies for multiaddress warehousing systems

Optimal storage assignment policies for multiaddress warehousing systems

0.00 Avg rating0 Votes
Article ID: iaor1989421
Country: United States
Volume: 19
Issue: 2
Start Page Number: 197
End Page Number: 204
Publication Date: Mar 1989
Journal: IEEE Transactions On Systems, Man and Cybernetics
Authors: ,
Keywords: manufacturing industries
Abstract:

The paper concerns optimal storage assignment in multiaddress warehousing systems. The modeling scenario is designed to reflect warehousing practices emphasizing short order picking cycle times and integrated operational control. Two theorems and proofs that are useful for finding optimal warehouse layouts based on a mathematical model of order picking costs for the case of aisle captive, multicommand order picking cycles are introduced. The results reported indicate one means for potentially decomposing the integrated warehousing problem to obtain locally optimal warehouse layouts for fixed inventory levels.

Reviews

Required fields are marked *. Your email address will not be published.