A polynomial algorithm for the production/ordering planning problem with limited storage

A polynomial algorithm for the production/ordering planning problem with limited storage

0.00 Avg rating0 Votes
Article ID: iaor20081664
Country: United Kingdom
Volume: 34
Issue: 4
Start Page Number: 934
End Page Number: 937
Publication Date: Apr 2007
Journal: Computers and Operations Research
Authors: , , ,
Keywords: inventory: order policies, inventory: storage
Abstract:

This paper concerns the dynamic lot size problem where the storage capacity is limited and shortages are allowed. The planning horizon is divided into T periods and, for each period, concave functions to define the holding/stockout and production costs are considered. It is proved that the results derived in a previous work for the dynamic lot size problem assuming time-varying storage capacities remain valid for the case with backlogging.

Reviews

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