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

Authors:
Agostinho Agra;Miguel Constantino
Affiliations:
Centro de Investigação Operacional, Faculdade de Ciências da Universidade de Lisboa, 1749-016 Lisboa, Portugal;Centro de Investigação Operacional e Departamento de Estatıstica e Investigação Operacional, Faculdade de Ciências da Universidade de Lisboa, 1749-016 Lisboa, Portuga ...
Venue:
Operations Research Letters
Year:
1999

Citing 3
Cited 4

Integer and combinatorial optimization

Integer and combinatorial optimization
Economic lot sizing: an O(n log n) algorithm that runs in linear time in the Wagner-Whitin case

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

Mathematical Programming: Series A and B

Mathematical Programming Models and Formulations for Deterministic Production Planning Problems

Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Inventory lot-sizing with supplier selection

Computers and Operations Research
Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation

Operations Research
Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine the uncapacitated single-item lotsizing problem with backlogging and start-up costs where Wagner-Whitin costs are assumed. We generalize some theoretical results obtained in [5] for the polyhedral description of the convex hull of feasible solutions for models that can be viewed as particular cases of the one treated in this paper (models without start-up costs and models where backlog is not allowed). In the presence of Wagner-Whitin costs (which satisfy p"t+h@?"t^+-p"t"+"1=0, for 0==0, for 1=