Efficient heuristics for inventory placement in acyclic networks

DOI10.1016/J.COR.2009.01.001zbMath1162.90320OpenAlexW2055657710MaRDI QIDQ1025232

Jia Shu, I. A. Karimi

Publication date: 18 June 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.01.001

zbMATH Keywords

heuristicsinventorysupply chain management

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05)

Related Items (7)

Meta-heuristics for placing strategic safety stock in multi-echelon inventory with differentiated service times ⋮ Maximum principle for optimal control of neutral stochastic functional differential systems ⋮ Multi-echelon inventory optimization for practitioners: a predictive global sensitivity analysis approach ⋮ Safety stock placement in supply chains with expediting ⋮ A typology and literature review on stochastic multi-echelon inventory models ⋮ New model and heuristics for safety stock placement in general acyclic supply chain networks ⋮ The hill detouring method for minimizing hinging hyperplanes functions

Cites Work

• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
• Dynamic programming algorithms for multi-stage safety stock optimization
• Some NP-complete problems in quadratic and nonlinear programming
• In-Process Inventories

This page was built for publication: Efficient heuristics for inventory placement in acyclic networks