A new characterization for the dynamic lot size problem with bounded inventory

A new characterization for the dynamic lot size problem with bounded inventory

0.00 Avg rating0 Votes
Article ID: iaor20031298
Country: United Kingdom
Volume: 30
Issue: 3
Start Page Number: 383
End Page Number: 395
Publication Date: Mar 2003
Journal: Computers and Operations Research
Authors: , , ,
Keywords: programming: dynamic
Abstract:

In this paper, we address the dynamic lot size problem with storage capacity. As in the unconstrained dynamic lot size problem, this problem admits a reduction of the state space. New properties to obtain optimal policies are introduced. Based on these properties a new dynamic programming algorithm is devised. Superiority of the new algorithm to the existing procedure is demonstrated. Furthermore, the new algorithm runs in O(T) expected time when demands vary between zero and the storage capacity. Computational results are reported for randomly generated problems.

Reviews

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