An O(n2) algorithm for lot sizing with inventory bounds and fixed costs

Authors:
Alper AtamtüRk;Simge KüçüKyavuz
Affiliations:
Department of Industrial Engineering and Operations Research, University of California, Berkeley, CA 94720-1777, USA;Department of Systems and Industrial Engineering, University of Arizona, Tucson, AZ 85721-0020, USA
Venue:
Operations Research Letters
Year:
2008

Citing 4
Cited 2

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
Improved algorithms for economic lot size problems

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

Operations Research

Optimal algorithms for the economic lot-sizing problem with multi-supplier

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Stochastic lot-sizing with backlogging: computational complexity analysis

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an O(n^2) dynamic programming algorithm for lot sizing with inventory bounds and fixed costs, where n is the number of time periods. The algorithm utilizes a hierarchy of two layers of value functions and improves the complexity bound of an earlier O(n^3) algorithm for concave-cost and bounded inventory.