Abstract
In this paper, we discuss the joint problem of order allocation and movable rack assignment to pickers in Kiva systems. Here, the allocation rule is to balance the workload of each picker; the requirement for assignment is to enable the pickers to receive all the items required that belong to the orders assigned to them. To this end, we first propose a basic integer programming model for allocating orders and racks simultaneously to pickers and expanded the constraints of the model to make the practical applicability stronger. The complexity of the problem is provided by us so that a heuristic algorithm for this problem is also given, which is directly based on our formulation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
