A revised proof of optimality for the cube-per-order index rule for stored item location

DOI10.1016/0307-904X(90)90076-HzbMath0701.90030MaRDI QIDQ914539

Charles J. Malmborg, Krishnakumar Bhaskaran

Publication date: 1990

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

zbMATH Keywords

heuristicswarehousecube-per-order indexdual-address order- pickinglayoutsstorage assignment

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (11)

Storage assignment and order batching problem in Kiva mobile fulfilment system ⋮ Research on warehouse operation: a comprehensive review ⋮ Class-Based Storage Assignment in a Unit-Load Warehouse Employing AS/RS with Inventory Space Allocation Considering Product Specific Setup to Holding Cost Ratio ⋮ Design and control of warehouse order picking: a literature review ⋮ How to optimize storage classes in a unit-load warehouse ⋮ An integrated performance model for orderpicking systems with randomized storage ⋮ A branch and bound algorithm for class based storage location assignment ⋮ Optimizing fishbone aisles for dual‐command operations in a warehouse ⋮ A survey of literature on automated storage and retrieval systems ⋮ Warehouse design and control: Framework and literature review ⋮ Storage assignment policy tradeoffs

Cites Work

• Optimal Storage Assignment in Automatic Warehousing Systems
• Unnamed Item
• Unnamed Item

This page was built for publication: A revised proof of optimality for the cube-per-order index rule for stored item location