An O(T log T) Algorithm for the Dynamic Lot Size Problem with Limited Storage and Linear Costs

Authors:
A. Sedeño-Noda;J. Gutiérrez;B. Abdul-Jalbar;J. Sicilia
Affiliations:
Dpto. de Estadística, Investigación Operativa y Computación (DEIOC), Universidad de La Laguna, 38271, La Laguna, Tenerife, Spain. asedeno@ull.es;Dpto. de Estadística, Investigación Operativa y Computación (DEIOC), Universidad de La Laguna, 38271, La Laguna, Tenerife, Spain;Dpto. de Estadística, Investigación Operativa y Computación (DEIOC), Universidad de La Laguna, 38271, La Laguna, Tenerife, Spain;Dpto. de Estadística, Investigación Operativa y Computación (DEIOC), Universidad de La Laguna, 38271, La Laguna, Tenerife, Spain
Venue:
Computational Optimization and Applications
Year:
2004

Citing 12
Cited 1

Approximation formulations for the single-product capacitated lot size problem

Operations Research
An O(T2) algorithm for the NI/G/NI/ND capacitated lot size problem

Management Science
Finding minimum-cost circulations by successive approximation

Mathematics of Operations Research
A simple forward algorithm to solve general dynamic lot sizing models with n periods in 0(n log n) or 0(n) time

Management Science
Economic lot sizing: an O(n log n) algorithm that runs in linear time in the Wagner-Whitin case

Operations Research - Supplement
Finding minimum-cost flows by double scaling

Mathematical Programming: Series A and B
A faster strongly polynomial minimum cost flow algorithm

Operations Research
Improved algorithms for economic lot size problems

Operations Research
Finding the minimum-cost maximum flow in a series-parallel network

Journal of Algorithms
An O(T3) algorithm for the economic lot-sizing problem with constant capacities

Management Science
Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems

Mathematics of Operations Research
A new characterization for the dynamic lot size problem with bounded inventory

Computers and Operations Research

Fast Algorithms for Specially Structured Minimum Cost Flow Problems with Applications

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper the dynamic lot size problem with time varying storage capacities and linear costs is addressed. Like in the uncapacitated version, this problem can be formulated as a network flow problem. Considering the properties of the underlying network, we devise an O(T log T) greedy algorithm to obtain optimal policies and we report computational results for randomly generated problems.