The inventory packing problem

DOI10.1002/1520-6750(198908)36:4%3C399::AID-NAV3220360406%3E3.0.CO;2-MzbMATH Open0672.90032OpenAlexW2043654534MaRDI QIDQ3826323FDOQ3826323

Authors: Nicholas G. Hall 

Publication date: 1989

Full work available at URL: https://doi.org/10.1002/1520-6750(198908)36:4%3C399::aid-nav3220360406%3E3.0.co;2-m

Recommendations

• A Comparison of Inventory Replenishment Heuristics for Minimizing Maximum Storage
• Mixed-integer linear programming heuristics for the prepack optimization problem
• scientific article; zbMATH DE number 563208
• scientific article; zbMATH DE number 3950202
• Worst-case analyses, linear programming and the bin-packing problem

zbMATH Keywords

heuristicsbin-packingworst-case performanceNP completecomputational testinginventory-packing problemminimum number of identical storage areas

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Inventory, storage, reservoirs (90B05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Comparison of Inventory Replenishment Heuristics for Minimizing Maximum Storage

Cited In (5)

• Mixed-integer linear programming heuristics for the prepack optimization problem
• A Comparison of Inventory Replenishment Heuristics for Minimizing Maximum Storage
• Storage management of items in two levels of availability
• Packing items to feed assembly lines
• The board packing problem

This page was built for publication: The inventory packing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3826323)