Meta-heuristics for placing strategic safety stock in multi-echelon inventory with differentiated service times

DOI10.1007/s10479-014-1635-1zbMath1350.90003OpenAlexW2067589005WikidataQ57517509 ScholiaQ57517509MaRDI QIDQ324327

Stefan Minner, Jörn Grahl, Daniel Dittmar

Publication date: 11 October 2016

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-014-1635-1

zbMATH Keywords

simulated annealingevolutionary algorithmsdifferentiated service timesguaranteed service approachsafety stock allocation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (6)

Evolutionary algorithms for supply chain management ⋮ Multi-echelon inventory optimization for practitioners: a predictive global sensitivity analysis approach ⋮ Safety stock placement in supply chains with expediting ⋮ Delay analysis of a two-class priority queue with external arrivals and correlated arrivals from another node ⋮ A typology and literature review on stochastic multi-echelon inventory models ⋮ The multi-sourcing location inventory problem with stochastic demand

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Efficient heuristics for inventory placement in acyclic networks
• Mehrstufige Sicherheitsbestandsplanung mit dynamischer Programmierung. (Multi-stage safety stock planning through dynamic programming)
• Dynamic programming algorithms for multi-stage safety stock optimization
• Strategic safety stocks in supply chains
• New model and heuristics for safety stock placement in general acyclic supply chain networks
• Representations for genetic and evolutionary algorithms. With a foreword by David E. Goldberg.
• An integrated guaranteed- and stochastic-service approach to inventory optimization in supply chains
• TECHNICAL NOTE—Optimizing Strategic Safety Stock Placement in General Acyclic Networks
• Optimizing Strategic Safety Stock Placement in Supply Chains with Clusters of Commonality
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning

This page was built for publication: Meta-heuristics for placing strategic safety stock in multi-echelon inventory with differentiated service times