Lot sizing with inventory gains

Authors:
Hamish Waterer
Affiliations:
Department of Engineering Science, The University of Auckland, Private Bag 92019, Auckland, New Zealand
Venue:
Operations Research Letters
Year:
2007

Citing 11
Cited 0

Solving multi-item capacitated lot-sizing problems using variable redefinition

Operations Research
A survey of dynamic network flows

Annals of Operations Research
A network-related nuclear power model with an intelligent branch-and-bound solution approach

Annals of Operations Research
Economic lot sizing: an O(n log n) algorithm that runs in linear time in the Wagner-Whitin case

Operations Research - Supplement
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Gainfree Leontief substitution flow problems

Mathematical Programming: Series A and B
Polyhedra for lot-sizing with Wagner-Whitin costs

Mathematical Programming: Series A and B
An O(T3) algorithm for the economic lot-sizing problem with constant capacities

Management Science
Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation

Management Science
Dynamic Economic Lot Size Model with Perishable Inventory

Management Science
Valid inequalities and separation for capacitated economic lot sizing

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The lot sizing problem with inventory gains generalizes the classical lot sizing problem to one in which stock is not conserved. Instances of this problem can be polynomially transformed into instances of the classical problem. The implications for problems involving different production capacity limitations, backlogging and multilevel production are discussed.