A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures

DOI10.1007/s00291-008-0130-yzbMath1160.90541MaRDI QIDQ1017972

Horst Tempelmeier, Lisbeth Buschkühl

Publication date: 13 May 2009

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-008-0130-y

zbMATH Keywords

multi-level; lotsizing; setup carry-over

Mathematics Subject Classification ID

90B50: Management decision making, including multiple objectives

90B30: Production models

Related Items

Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines, Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic, An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times, Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms, Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over

Cites Work

• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Lot sizing and scheduling -- survey and extensions
• Lotsizing and scheduling for production planning
• Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
• Heuristics for Multilevel Lot-Sizing with a Bottleneck
• A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times