A review on stochastic models and analysis of warehouse operations

Abstract

This paper provides an overview of stochastic research in warehouse operations. We identify uncertainty sources of warehousing systems and systematically present typical warehouse operations from a stochastic system viewpoint. Stochastic modeling methods and analysis techniques in existing literature are summarized, along with current research limitations. Through a comparison between potential and existing stochastic warehouse applications, we identify potential new research applications. Furthermore, by comparing potential and existing solution methods, methodological directions relevant to practice and largely unexplored in warehouse literature are identified.

The travelling of forklifts in warehouses

“…Pallet pick is considered as retrieval of pallet from storage location to shipping doors. In literature operations with information technology-based tools are also classified into pallet picking with scanners [10]. A barcode scanner is a wireless scanning technology that communicates with the host system [11].…”

“…Also these portable computers can be used to map out the most efficient route. Using such possibilities, for example, during a tour the driver of forklift can be also instructed, to take items which have been just received at warehouse [10]. The driver of forklift can use portable scanner (it is used to improve the accuracy of information and data transmission speed and encourage information sharing).…”

Optimal Selection of Movable Shelves under Cargo-to-Person Picking Mode

“…Although there are few studies of the picking methods used in the cargo-to-person picking mode, the picking methods under the classical person-to-cargo picking mode are well-studied [10][11][12]. In the person-to-cargo picking mode, the picking process consists of the following steps: order-batching, sequencing and routing, and sorting [10].…”

“…The order-batching problem is a special clustering problem, and most research about this problem focuses on designing efficient algorithms for different objective functions [10][11][12]. Pan et al [13] developed an order-batching approach for a pick-and-pass system.…”

“…The static sequencing and routing problems are similar to the TSP and are NP-hard, and the dynamic sequencing and routing problem is more difficult. Most research on this problem focuses on designing efficient algorithms [10][11][12]. Lu et al [17] studied dynamic order-picking route problem and proposed a new routing algorithm for it.…”