期刊
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
卷 61, 期 7, 页码 2086-2104出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207543.2022.2058433
关键词
Warehouse management; order picking; zone picking; workload balancing; dynamic programming; heuristics
This paper investigates the order picker routing problem in a dynamic and synchronised zoning environment, aiming to minimize the maximum time of completing picking activities in any zone. The use of a min-max type objective helps balance the workload of order pickers more effectively.
In both manual and automated warehouses, a combination of efficient zoning and picker routing plays an important role in improving travel time, congestion, and system throughput. This paper considers the order picker routing problem in a dynamic and synchronised zoning environment, where the items corresponding to each customer order are picked simultaneously in multiple zones, and zones may change between different orders. The objective is to minimise the maximum time of completing the picking activities in any zone. Using a min-max type of objective not only minimises the makespan of an order picking wave, but it also helps balance the workload of the order pickers more effectively. We present a mathematical model for the optimal solution of this problem, as well as a dynamic programming approach to find the optimal solution for the case where a zone is a set of adjacent aisles. Computational experiments on randomly generated instances show that the dynamic programming approach is able to find optimal solutions in negligible computational times.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据