Article ID: | iaor20108309 |
Volume: | 129 |
Issue: | 1 |
Start Page Number: | 147 |
End Page Number: | 156 |
Publication Date: | Jan 2011 |
Journal: | International Journal of Production Economics |
Authors: | Langevin Andr, Riopel Diane, Chen Lu |
Keywords: | programming: integer, heuristics: tabu search |
Relocation of items in a warehousing system is usually used when the handling machines become the bottleneck. This paper addresses the optimization problem of relocation in a warehouse with dynamic operating policy. An integer linear programming formulation is proposed. A two-stage heuristic method is developed to generate an initial solution. A tabu search algorithm is proposed to improve the solution. Two relocation policies are studied and their performances are compared.