Document Type

Research Paper

Publication Date



Fast-pick areas are commonly used in order picking warehouses to improve labor efficiency by concentrating picking activities within a compact area, thus minimizing the distance traveled by the pickers. One problem that must be solved when a fast-pick area is to be implemented is the so-called assignment-allocation problem. This deals with deciding which products should be assigned to the fast-pick area, and how much space should be allocated to these products. This research was motivated by the picking operation of a cosmetics distribution center where several fast-pick areas are in place. A mixed integer linear programming formulation is proposed for solving the variant of the assignment-allocation problem found in this company. Our computational experiments show that the proposed model is efficient for solving small yet realistic instances of the problem.


Paper 18

Publication Title

Progress in Material Handling Research