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

DOI10.1080/00207540110081461MaRDI QIDQ4674438zbMATH OpenOpenAlexFDO

Authors

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

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times
• Multilevel capacitated lotsizing complexity and LP-based heuristics
• An improved heuristic for the capacitated lot-sizing problem
• Analysis of relaxations for the multi-item capacitated lot-sizing problem
• The capacitated lot-sizing problem with linked lot sizes

Cites work

• scientific article; zbMATH DE number 429663 (Why is no real title available?)
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• scientific article; zbMATH DE number 870551 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
• Introduction to Stochastic Programming
• Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing
• Multilevel capacitated lotsizing complexity and LP-based heuristics
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• The Lagrangian Relaxation Method for Solving Integer Programming Problems

Cited in

(20)

• On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times
• Multi-item capacitated lot-sizing with demand uncertainty
• A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures
• 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
• Minimizing average project team size given multi-skilled workers with heterogeneous skill levels
• 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
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Multilevel capacitated lotsizing complexity and LP-based heuristics
• Tactical production and lot size planning with lifetime constraints: a comparison of model formulations
• Worst case analysis of relax and fix heuristics for lot-sizing problems
• Model formulations for the capacitated lot-sizing problem with service-level constraints
• Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times
• The capacitated lot-sizing problem with linked lot sizes
• Capacitated lot sizing with alternative routings and overtime decisions
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
• Efficient reformulations for dynamic lot-sizing problems with product substitution
• A heuristic approach for the integrated production-transportation problem with process flexibility
• Period decompositions for the capacitated lot sizing problem with setup times

This page was built for publication: LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4674438)