On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times

DOI10.1057/PALGRAVE.JORS.2601996zbMath1086.90003OpenAlexW2037603740MaRDI QIDQ3378819

Haldun Süral, Meltem Denizel

Publication date: 4 April 2006

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601996

zbMATH Keywords

heuristicsvalid inequalitiescapacitated lot-sizingreformulation

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (10)

Efficient reformulations for dynamic lot-sizing problems with product substitution ⋮ Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times ⋮ Multi-stage simultaneous lot-sizing and scheduling for flow line production ⋮ A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times ⋮ Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines ⋮ Multi-echelon supply chains with lead times and uncertain demands. A lot-sizing formulation and solutions ⋮ Lagrangean relaxation based heuristics for lot sizing with setup times ⋮ A capacitated lot sizing problem with stochastic setup times and overtime ⋮ Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times ⋮ Solving lot-sizing problem with quantity discount and transportation cost

This page was built for publication: On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times