View article

This research work deals with the single-item dynamic lot size problem under (i) age-dependent inventory deterioration rates and inventory costs and (ii) stockouts (or lost sales, that is, the demands do not have to be satisfied). Two equivalent forward dynamic programming (DP) algorithms are devised to solve this problem in O (T 3) time based on several properties of the optimal solution, where T denotes the length of the problem horizon. Moreover, a special case with no speculative motive cost structures is investigated. Compared to the general time-variant case, two equivalent algorithms for efficient forward DP in O (T 2) time are developed. Furthermore, we study the problem under storage capacity constraint and develop a forward DP algorithm to solve this problem. Finally, we offer two useful managerial insights by using a comprehensive test bed of instance:(i) the stockout policy can reduce the total costs …