Solving multi-item capacitated lot-sizing problems using variable redefinition
Operations Research
Economic lot sizing: an O(n log n) algorithm that runs in linear time in the Wagner-Whitin case
Operations Research - Supplement
Improved algorithms for economic lot size problems
Operations Research
Polyhedra for lot-sizing with Wagner-Whitin costs
Mathematical Programming: Series A and B
Computational complexity of uncapacitated multi-echelon production planning problems
Operations Research Letters
MIP formulations and heuristics for two-level production-transportation problems
Computers and Operations Research
A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
Operations Research
Hi-index | 0.00 |
For the uncapacitated two-level production-in-series T period lot-sizing model, a dynamic program with running time O(T^2logT) and a compact and tight extended formulation with O(T^3) variables and O(T^2) equality constraints are presented. Limited computational comparisons of various formulations of two-level production/transportation problems with multiple clients are reported.