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

DOI10.1007/S00291-008-0130-YzbMath1160.90541OpenAlexW1971271004MaRDI QIDQ1017972

Lisbeth Buschkühl, Horst Tempelmeier

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-levellotsizingsetup carry-over

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Production models (90B30)

Related Items (13)

Lead time considerations for the multi-level capacitated lot-sizing problem ⋮ A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders ⋮ Hybrid methods for lot sizing on parallel machines ⋮ Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms ⋮ The setup carryover assignment problem ⋮ Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines ⋮ Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials ⋮ An integrated approach for production lot sizing and raw material purchasing ⋮ An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times ⋮ Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic ⋮ Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory ⋮ Editorial. Quantitative approaches in production management ⋮ 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

This page was built for publication: A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures