Lower Bounds in Lot-Sizing Models: A Polyhedral Study
From MaRDI portal
Publication:2757525
DOI10.1287/moor.23.1.101zbMath0977.90029OpenAlexW2155163038MaRDI QIDQ2757525
Publication date: 26 November 2001
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.23.1.101
Related Items (16)
A polyhedral study of production ramping ⋮ Lifted Euclidean inequalities for the integer single node flow set with upper bounds ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs ⋮ Forecast horizon of dynamic lot size model for perishable inventory with minimum order quantities ⋮ An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities ⋮ LS-LIB: A Library of Tools for Solving Production Planning Problems ⋮ A polyhedral study of lot-sizing with supplier selection ⋮ Modeling industrial lot sizing problems: a review ⋮ The splittable flow arc set with capacity and minimum load constraints ⋮ Lot sizing with minimum order quantity ⋮ The multi-item capacitated lot-sizing problem with setup times and shortage costs ⋮ A dynamic lot sizing model with production-or-outsourcing decision under minimum production quantities ⋮ Mixing MIR inequalities with two divisible coefficients ⋮ Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution ⋮ Polyhedral description of the integer single node flow set with constant bounds
This page was built for publication: Lower Bounds in Lot-Sizing Models: A Polyhedral Study
