Single item lot-sizing with non-decreasing capacities
From MaRDI portal
Publication:847825
DOI10.1007/s10107-008-0228-7zbMath1190.90108OpenAlexW2118976293MaRDI QIDQ847825
Yves Pochet, Laurence A. Wolsey
Publication date: 19 February 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-008-0228-7
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30) Production theory, theory of the firm (91B38)
Related Items
Relaxations for two-level multi-item lot-sizing problems, LS-LIB: A Library of Tools for Solving Production Planning Problems, Lot sizing with minimum order quantity, Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case, Primal-dual schema for capacitated covering problems
Uses Software
Cites Work
- Lot-sizing on a tree
- Compact formulations as a union of polyhedra
- The mixing-MIR set with divisible capacities
- Valid inequalities and separation for capacitated economic lot sizing
- Tight formulations for some simple mixed integer programs and convex objective integer programs
- Polyhedra for lot-sizing with Wagner-Whitin costs
- A study of the lot-sizing polytope
- Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity
- The Mixing Set with Flows
- An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
- Deterministic Production Planning: Algorithms and Complexity
- Computational Complexity of the Capacitated Lot Size Problem
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size
- Production Planning by Mixed Integer Programming
- The Continuous Mixing Polyhedron
