Single item lot-sizing with non-decreasing capacities

DOI10.1007/S10107-008-0228-7MaRDI QIDQ847825zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

LP-relaxationmixing set relaxation

Mathematics Subject Classification ID

Production models (90B30) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production theory, theory of the firm (91B38)

Recommendations

• Polyhedra for lot-sizing with Wagner-Whitin costs
• scientific article; zbMATH DE number 780785
• An efficient algorithm for the capacitated single item dynamic lot size problem
• Lot-sizing with non-stationary cumulative capacities
• An effective algorithm for the capacitated single item lot size problem

Cites work

• A study of the lot-sizing polytope
• Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size
• An O(T²) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
• An O(T³) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
• Compact formulations as a union of polyhedra
• Computational Complexity of the Capacitated Lot Size Problem
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• Deterministic Production Planning: Algorithms and Complexity
• Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity
• Lot-sizing on a tree
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
• Polyhedra for lot-sizing with Wagner-Whitin costs
• Production Planning by Mixed Integer Programming
• The Continuous Mixing Polyhedron
• The Mixing Set with Flows
• The mixing-MIR set with divisible capacities
• Tight formulations for some simple mixed integer programs and convex objective integer programs
• Valid inequalities and separation for capacitated economic lot sizing

Cited in

(8)

• Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
• Production lot-sizing with dynamic capacity adjustment
• A single-item lot-sizing problem with a by-product and inventory capacities
• Single item lot-sizing problem for a warm/cold process with immediate lost sales
• LS-LIB: a library of tools for solving production planning problems
• Relaxations for two-level multi-item lot-sizing problems
• Lot sizing with minimum order quantity
• Primal-dual schema for capacitated covering problems

Describes a project that uses

Uses Software

• XPRESS

This page was built for publication: Single item lot-sizing with non-decreasing capacities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847825)