An O(T log T) algorithm for the dynamic lot size problem with limited storage and linear costs

An O(T log T) algorithm for the dynamic lot size problem with limited storage and linear costs

0.00 Avg rating0 Votes
Article ID: iaor20043428
Country: Netherlands
Volume: 28
Issue: 3
Start Page Number: 311
End Page Number: 323
Publication Date: Sep 2004
Journal: Computational Optimization and Applications
Authors: , , ,
Keywords: lot sizing
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.

Reviews

Required fields are marked *. Your email address will not be published.