Lot-sizing with non-stationary cumulative capacities

Authors:
F. Zeynep Sargut;H. Edwin Romeijn
Affiliations:
Department of Industrial and Systems Engineering, University of Florida, P.O. Box 116595, Gainesville, FL 32611-6595 USA;Department of Industrial and Systems Engineering, University of Florida, P.O. Box 116595, Gainesville, FL 32611-6595 USA
Venue:
Operations Research Letters
Year:
2007

Citing 8
Cited 1

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
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Improved algorithms for economic lot size problems

Operations Research
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
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure

Mathematical Programming: Series A and B

Four equivalent lot-sizing models

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a new class of capacitated economic lot-sizing problems. We show that the problem is NP-hard in general and derive a fully polynomial-time approximation algorithm under mild conditions on the cost functions. Furthermore, we develop a polynomial-time algorithm for the case where all cost functions are concave.