We consider the problem of sequencing picks in a set of orders on a single carousel. First we consider the situation in which the sequence of the orders is given. For this problem we present an efficient dynamic programming algorithm. Second, we consider the problem without a given order sequence. We simplify this problem to a Rural Postman Problem on a circle and solve this problem to optimality. Finally, we show that the solution of the Rural Postman Problem requires at most 1.5 revolutions more than a lower bound of an optimum solution to the original problem.
No takes yet. Share an insight, caveat, or question.
J.P. van den Berg (1996) studied this question.