The complexity of the staggering problem, and other classical inventory problems

DOI10.1016/0167-6377(92)90021-TzbMath0762.90020OpenAlexW2041951448MaRDI QIDQ1200761

David Simchi-Levi, Guillermo Gallego, Dong X. Shaw

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(92)90021-t

zbMATH Keywords

heuristicsNP-completenesswarehousestaggeringmulti-item inventory system

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Inventory, storage, reservoirs (90B05)

Related Items (6)

Offsetting inventory replenishment cycles ⋮ The inventory replenishment planning and staggering problem: a bi-objective approach ⋮ The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem ⋮ On capacitated multi-item inventory problems. ⋮ Stochastic multiproduct inventory models with limited storage ⋮ Offsetting inventory replenishment cycles to minimize storage space

Cites Work

• Unnamed Item
• Unnamed Item
• Multi-Item Replenishment and Storage Problem (MIRSP): Heuristics and Bounds
• The Deterministic, Two-Product, Inventory System with Capacity Constraint
• An Algorithm for Limited Capacity Inventory Problem with Staggering
• Multi-Product Inventory Situations with One Restriction
• Deterministic Multi-Item Inventory Systems with Limited Capacity
• A Note on "Multi-Product Inventory Situations with One Restriction"
• Single Resource Multi-Item Inventory Systems

This page was built for publication: The complexity of the staggering problem, and other classical inventory problems