A Greedy Exchange Method for Warehouse Slotting (GEMWS)

Abstract

This note presents a Greedy Exchange Method for Warehouse Slotting (GEMWS). The method groups storage locations by capacity, matches forward-pick and rear-pick partitions, and repeatedly exchanges the highest-velocity rear-pick SKU with the lowest-velocity forward-pick SKU whenever doing so improves total forward-pick velocity. The note provides a mathematical formulation and proofs of termination and optimality within each selected pair of partitions, assuming exchanges are feasible in both directions. It also discusses related work and limitations, including location-specific constraints and the distinction between within-partition optimality and global warehouse optimization.