Dynamic lot sizing with inventory bounds for a perishable product
研究了有保质期和存储容量约束的易腐产品动态批量问题，考虑不同年龄库存的持有成本差异，提出忽略保质期的条件并开发高效动态规划算法求解。
We investigate a dynamic lot-sizing problem with storage capacities for a perishable product that has a certain expiration date. The costs of carrying inventory stocks are differentiated by their ages, and the procurement cost functions are assumed to be general concave. We identify a condition related to the storage capacity constraint, under which the expiration date can be ignored. Then, the structural properties of the optimal solution are discussed. We use the properties to develop an efficient dynamic programming algorithm to solve the problem optimally. A faster algorithm is provided to solve a special case with fixed-plus-linear procurement costs. We conduct computational experiments to evaluate the efficiency of our algorithm and provide several insights into perishable inventory management under storage capacities.