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

DOI10.1007/s00291-007-0094-3zbMath1193.90022OpenAlexW1987081645MaRDI QIDQ991842

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

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

productionlinear relaxationcapacitated lot-sizingstrong formulation

Mathematics Subject Classification ID

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

Related Items

Dynamic capacitated lot-sizing problems: a classification and review of solution approaches ⋮ Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times ⋮ A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders ⋮ Multi-stage simultaneous lot-sizing and scheduling for flow line production ⋮ Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines ⋮ Lagrangean relaxation based heuristics for lot sizing with setup times ⋮ On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times ⋮ The one-warehouse multi-retailer problem: reformulation, classification, and computational results

Cites Work

• Unnamed Item
• Unnamed Item
• Multilevel capacitated lotsizing complexity and LP-based heuristics
• Analysis of relaxations for the multi-item capacitated lot-sizing problem
• Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing
• Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing
• Improved lower bounds for the capacitated lot sizing problem with setup times.
• On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm

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