A branch and bound algorithm for class based storage location assignment

DOI10.1016/j.ejor.2007.05.050zbMath1149.90362OpenAlexW1970124755MaRDI QIDQ2480991

Venkata Reddy Muppani (Muppant), Gajendra Kumar Adil

Publication date: 7 April 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.05.050

zbMATH Keywords

branch and boundorder pickingstorage spaceclass based storagewarehouse storage planning

Mathematics Subject Classification ID

Marketing, advertising (90B60)

Related Items (4)

A travel time estimation model for a high-level picker-to-part system with class-based storage policies ⋮ New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot ⋮ Storage location assignment of steel coils in a manufacturing company: an integer linear programming model and a greedy randomized adaptive search procedure ⋮ Unnamed Item

Cites Work

• Research on warehouse operation: a comprehensive review
• A revised proof of optimality for the cube-per-order index rule for stored item location
• Warehouse design and control: Framework and literature review
• Optimal Storage Assignment in Automatic Warehousing Systems
• Storage-Retrieval Interleaving in Automatic Warehousing Systems
• Expected travel time and optimal boundary formulas for a two-class-based automated storage/retrieval system

This page was built for publication: A branch and bound algorithm for class based storage location assignment