| Article ID: | iaor19981083 |
| Country: | Netherlands |
| Volume: | 20 |
| Issue: | 1 |
| Start Page Number: | 7 |
| End Page Number: | 13 |
| Publication Date: | Jan 1997 |
| Journal: | Operations Research Letters |
| Authors: | Hoesel C.P.M. van, Eijl C.A. van |
| Keywords: | scheduling |
We consider the single-item discrete lot-sizing and scheduling problem. We present a partial linear description of the convex hull of feasible solutions that solves this problem in the presence of Wagner–Whitin costs.