LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm

DOI10.1080/00207540110081461zbMath1060.90687MaRDI 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

Mathematics Subject Classification ID

90C05: Linear programming

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Capacitated lot sizing with alternative routings and overtime decisions, The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, Multi-item capacitated lot-sizing with demand uncertainty

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