Single item lot-sizing with non-decreasing capacities
(2010) Mathematical Programming — Vol. 121, n° 1, p. 123-143 (2010)
Files
2145.pdf
Restricted Access - Adobe PDF
- 360.44 KB
Details
- Authors
- Abstract
- We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is (i) non-speculative or Wagner-Whitin (for instance, constant unit production costs and non-negative unit holding costs) and (ii) the production set-up costs are non-increasing over time, it is known that the minimum cost lot-sizing problem is polynomially solvable using dynamic programming. When the capacities are non-decreasing, we derive a compact mixed integer programming reformulation whose linear programming relaxation solves the lot-sizing problem to optimality when the objective function satisfies (i) and (ii). The formulation is based on mixing set relations and reduces to the (known) convex hull of solutions when the capacities are constant over time. We illustrate the use and potential effectiveness of this improved LP formulation on a few test instances, including instances with and without Wagner-Whitin costs, and with both non-decreasing and arbitrary capacities over time.
- Affiliations
Citations
Pochet, Y., & Wolsey, L. (2010). Single item lot-sizing with non-decreasing capacities. Mathematical Programming, 121(1), 123-143. https://doi.org/10.1007/s10107-008-0228-7 (Original work published 2010)