Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs

Operations Research Letters

Volumn 25, Issue 2, 1999, Pages 81-88

  Agra, Agostinho ^a   Constantino, Miguel ^a  

^a UNIVERSITY OF LISBON   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; COSTS; INDUSTRIAL ECONOMICS; INTEGER PROGRAMMING; INVENTORY CONTROL; MATHEMATICAL MODELS; PROCESS CONTROL; RESOURCE ALLOCATION; SCHEDULING;

BACKLOGGING; LOTSIZING; MIXED INTEGER PROGRAMMING; POLYHEDRAL COMBINATORIC METHODS; WAGNER-WHITIN COSTS;

PRODUCTION CONTROL;

EID: 0032639383     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(99)00030-9     Document Type: Article

References (8)

1. A. Agra, M. Constantino, Lotsizing with backlogging and start-ups: the case of Wagner-Whitin costs. Technical report, CIO, University of Lisbon, Portugal, 1997. Working paper 5 / 97.
2. A.W.J. Kolen, C.P.M. van Hoesel, A.P.M. Wagelmans, Economic lot-sizing: an O(n log n) algorithm that runs in linear time in Wagner-Whitin case, Oper. Res. 40 (Suppl 1) (1992) 145-156.
3. L.R. Ford Jr, D.R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
4. G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.
5. Pochet Y., Wolsey L.A. Polyhedra for lot-sizing with Wagner-Whitin costs. Math. Programm. 67:1994;297-323.
6. Y. Pochet, L.A. Wolsey, Algorithms and reformulations for lot-sizing problems. in: L. Lovasz, W. Cook, P. Seymour (Eds.), Combinatorial Optimization, DIMACS Series in Discrete Mathematics and Computer Science, 1995, pp. 245-294.
7. C.P.M. van Hoesel, Models and algorithms for single-item lot-sizing problem, Ph.D. Thesis, Erasmus University, Rotterdam, The Netherlands, 1991.
8. Zangwill W.I. Minimum concave cost flows in certain networks. Manage. Sci. 14:1968;429-450.