| dc.description.abstract | Order picking is a warehouse task that involves locating items in storage and retrieving
them to fulfill specific client requests. Several orders from different customers combined
into a single picking order might boost warehouse productivity. The Order Batching
Problem, which is the subject of this study, asks how various client orders should be
combined into selecting orders so that the overall duration of all warehouse tours is kept to
a minimum. For the Order Batching Problem, we develop a Mix-Interger Linear
Programming (MILP) in this study that takes S-shape (traversal) and return routing policies
into account for solving the order batching, assignment and pickers routing problems | en_US |
