On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
From MaRDI portal
Publication:1374379
DOI10.1016/S0167-6377(96)00043-0zbMath0889.90084MaRDI QIDQ1374379
Stan P. M. van Hoesel, C. A. van Eijl
Publication date: 15 January 1998
Published in: Operations Research Letters (Search for Journal in Brave)
polyhedral combinatorics; convex hull of feasible solutions; single-item discrete lot-sizing; Wagner-Whitin costs