A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case
From MaRDI portal
Publication:1411630
DOI10.1007/s10107-002-0340-zzbMath1030.90021OpenAlexW1997142336MaRDI QIDQ1411630
Andrew J. Miller, Savelsbergh, Martin W. P., Nemhauser, George I.
Publication date: 29 October 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-002-0340-z
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30)
Related Items
Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Partial objective inequalities for the multi-item capacitated lot-sizing problem ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups ⋮ An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging ⋮ Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs ⋮ Lifting, superadditivity, mixed integer rounding and single node flow sets revisited ⋮ On a fix-and-relax framework for a class of project scheduling problems
