Optimal order-to-lane assignments in an order accumulation/sortation system

This paper considers a two-level order accumulation/sortation system and develops an algorithm to optimally assign orders to lanes based on the arrival sequence of items to the sortation system. With the use of the algorithm we show significant throughput increases, where throughput is based on the time to sort a complete order pick-wave. Examples illustrate the effectiveness of the algorithm on small and large problems.