ABC β–a heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint
From MaRDI portal
Publication:3163207
DOI10.1080/00207540903179782zbMath1197.90346OpenAlexW2089548660MaRDI QIDQ3163207
Sascha Herpers, Horst Tempelmeier
Publication date: 25 October 2010
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540903179782
Related Items (9)
Fenced in? Stochastic and deterministic planning models in a time-fenced, rolling-horizon scheduling system ⋮ Linear programming models for a stochastic dynamic capacitated lot sizing problem ⋮ Erratum to: ``Linear programming models for a stochastic dynamic capacitated lot sizing problem ⋮ Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem ⋮ Dynamic capacitated lot sizing with random demand and dynamic safety stocks ⋮ An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand ⋮ Capacitated disassembly scheduling under stochastic yield and demand ⋮ A stochastic multi-item replenishment and delivery problem with lead-time reduction initiatives and the solving methodologies ⋮ Editorial. Quantitative approaches in production management
Cites Work
- Supply chain inventory optimization with two customer classes in discrete time
- Setting safety stocks in multi-stage inventory systems under rolling horizon mathematical programming models
- MRP and inventories
- Multiple items procurement under stochastic nonstationary demands
- Multi-item capacitated lot-sizing with demand uncertainty
- Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
This page was built for publication: ABC β–a heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint
