A new heuristic approach for the multi-item dynamic lot sizing problem
From MaRDI portal
Publication:1331607
DOI10.1016/0377-2217(94)90078-7zbMath0806.90031OpenAlexW2054571693MaRDI QIDQ1331607
Publication date: 21 August 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90078-7
Related Items (11)
Dynamic lot sizing and tool management in automated manufacturing systems ⋮ Dynamic capacitated lot-sizing problems: a classification and review of solution approaches ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ A simple heuristic for multi-product dynamic lot sizing problems ⋮ Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem ⋮ A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs ⋮ Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company ⋮ Unnamed Item ⋮ Lot sizing and scheduling -- survey and extensions ⋮ Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions ⋮ Combining population-based and exact methods for multi-level capacitated lot-sizing problems
Cites Work
- Set partitioning and column generation heuristics for capacitated dynamic lotsizing
- A simple heuristic for the multi-item single level capacitated lotsizing problem
- An efficient algorithm for the capacitated single item dynamic lot size problem
- Planning lot sizes and capacity requirements in a single stage production system
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Deterministic Production Planning: Algorithms and Complexity
- An Efficient Algorithm for Multi-Item Scheduling
This page was built for publication: A new heuristic approach for the multi-item dynamic lot sizing problem
