Single-prodect dynamic lot-sizing : review and extension

단일품목 동적 롯트량결정에 대한 이론적 고찰과 적용

In this study, We reviewed the solution methods (for the heuristic and optimization method) for the single-item dynamic lot-sizing problem, and improved the efficiency (speed and optimality) of the conventional heuristic method by utilizing the inventory decomposition property. The iventory decomposition property decomposes the given original problem into several independent subproblems without violating the optimality conditions. Then we solve each decomposed subproblems by using the conventional heuristics such as LTC, LUC, Silver-Meal etc. For testing the efficiency of the proposed decomposition method, we adopted the data sets given in Kaimann, Berry and Silver-Meal. The computational results show that the suggested problem solving framework results in some promising effects on the computation time and the degree of optimality.