Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times

DOI10.1007/S00291-007-0094-3MaRDI QIDQ991842zbMATH OpenOpenAlexFDO

Authors Meltem Denizel, F. Tevhide Altekin, Haldun Süral, Hartmut Stadtler

Publication date 8 September 2010

Published in OR Spectrum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00291-007-0094-3

zbMATH Keywords

capacitated lot-sizinglinear relaxationproductionstrong formulation

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Recommendations

• On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times
• Equivalent formulations for economic lot-sizing problem with remanufacturing and joint setups
• On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times
• A Lagrangean relaxation approach for capacitated lot sizing problem with setup times
• The multi-item capacitated lot-sizing problem with setup times and shortage costs

Cites work

• Analysis of relaxations for the multi-item capacitated lot-sizing problem
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3568353 (Why is no real title available?)
• Improved lower bounds for the capacitated lot sizing problem with setup times.
• LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
• Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing
• Multilevel capacitated lotsizing complexity and LP-based heuristics
• On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times
• Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition

Cited in

(10)

• Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
• The one-warehouse multi-retailer problem: reformulation, classification, and computational results
• Multi-stage simultaneous lot-sizing and scheduling for flow line production
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
• A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders
• Period decompositions for the capacitated lot sizing problem with setup times
• Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
• Equivalent formulations for economic lot-sizing problem with remanufacturing and joint setups
• On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times
• Lagrangean relaxation based heuristics for lot sizing with setup times

This page was built for publication: Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times

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