An order batching and processing heuristic to address aisle congestion in a manual order picking warehouse with order due dates
A heuristic for batching orders in a manual order-picking warehouse has been developed. It prioritizes orders based on due time to prevent mixing of orders of different priority levels. The order density of aisles criterion is used to form batches. It also determines the number of pickers required and assigns batches to pickers such that there is a uniform workload per unit of time. The effectiveness of the heuristic was studied by observing computational time and aisle congestion for various numbers of total orders and number of orders that form a batch. An initial heuristic performed well for small number of orders, but for larger number of orders, a partitioning technique is computationally more efficient, needing only minutes to solve for thousands of orders, while preserving 90% of the batch quality obtained with the original heuristic. Comparative studies between the heuristic and other published heuristics are needed. ^
Engineering, Industrial|Operations Research
Sundaram, Ramakrishnan, "An order batching and processing heuristic to address aisle congestion in a manual order picking warehouse with order due dates" (2004). ProQuest ETD Collection for FIU. AAI1420118.