On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs

Authors:
C. A. Van Eijl;C. P. M. Van Hoesel
Affiliations:
Eindhoven University of Technology, Department of Mathematics and Computing Science, P.O. Box 513, 5600 MB Eindhoven, Netherlands;University Maastricht, Department of Quantitive Economics, P.O. Box 616, 6200 MD Maastricht, Netherlands
Venue:
Operations Research Letters
Year:
1997

Citing 2
Cited 2

A strong cutting plane algorithm for production scheduling with changeover costs

Operations Research
Polyhedra for lot-sizing with Wagner-Whitin costs

Mathematical Programming: Series A and B

Discrete lot sizing and scheduling using product decomposition into attributes

Computers and Operations Research
On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.