An assignment algorithm for dynamic picking systems.: An article from: IIE Transactions

This digital document is an article from IIE Transactions, published by Institute of Industrial Engineers, Inc. (IIE) on August 1, 1996. The length of the article is 6709 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available in your Amazon.com Digital Locker immediately after purchase. You can view it with any web browser.

From the author: In a dynamic environment, such as high-technology industry, a forward picking area requires an intelligent approach to ongoing rewarehousing (reassignment of stock items to locations). The items go through life cycles and product mix changes. Some items are common across multiple families in the product mix. Several of the items also tend to be picked in conjunction with other items, so their locations in the picking face should be made considering correlated assignments. This problem is not limited to high-technology industries, but also occurs in any setting where there are seasonalities or promotional programs, such as in retail distribution. This paper describes an approach, conceptual framework, and heuristic Dynamic Stock Location Assignment Algorithm (SLAA) for dynamic reconfiguration of the order picking system. Previous relevant research is reviewed. This paper also provides a sensitivity analysis of the algorithm and shows that it performs consistently better than the cube per order index rule at minimizing order processing time in dynamic environments with changing popularity and correlation of demand.

Citation Details
Title: An assignment algorithm for dynamic picking systems.
Author: Malik Sadiq
Publication:IIE Transactions (Refereed)
Date: August 1, 1996
Publisher: Institute of Industrial Engineers, Inc. (IIE)
Volume: v28 Issue: n8 Page: p607(10)

Distributed by Thomson Gale