LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
From MaRDI portal
Publication:4674438
DOI10.1080/00207540110081461zbMath1060.90687OpenAlexW2107589440MaRDI QIDQ4674438
No author found.
Publication date: 11 May 2005
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540110081461
Related Items (14)
Integrating deterioration and lifetime constraints in production and supply chain planning: a survey ⋮ New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups ⋮ Efficient reformulations for dynamic lot-sizing problems with product substitution ⋮ Dynamic capacitated lot-sizing problems: a classification and review of solution approaches ⋮ Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Minimizing average project team size given multi-skilled workers with heterogeneous skill levels ⋮ Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations ⋮ Multi-item capacitated lot-sizing with demand uncertainty ⋮ Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines ⋮ The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times ⋮ Capacitated lot sizing with alternative routings and overtime decisions ⋮ Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times ⋮ Worst case analysis of relax and fix heuristics for lot-sizing problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- Introduction to Stochastic Programming
This page was built for publication: LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
