Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
From MaRDI portal
Publication:3637368
DOI10.1287/opre.51.4.557.16094zbMath1165.90541OpenAlexW2156646495MaRDI QIDQ3637368
Andrew J. Miller, Laurence A. Wolsey
Publication date: 9 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3bb5e0ecbf06cc331fa848eca3f6b187a58cd76c
Mixed integer programming (90C11) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (14)
Simultaneous lotsizing and scheduling problems: a classification and review of models ⋮ Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms ⋮ Cascading knapsack inequalities: reformulation of a crude oil distribution problem ⋮ Discrete multi-module capacitated lot-sizing problems with multiple items ⋮ LS-LIB: A Library of Tools for Solving Production Planning Problems ⋮ Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs ⋮ Compact formulations as a union of polyhedra ⋮ Modeling industrial lot sizing problems: a review ⋮ Manufacturer's mixed pallet design problem ⋮ Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution ⋮ Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity ⋮ Discrepancies in solutions between traditional and net present value formulations of finite horizon, discrete-time economic lot size problems ⋮ Multi-item lot-sizing with joint set-up costs ⋮ Approximate extended formulations
Uses Software
This page was built for publication: Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
