Stock Efficiency Algorithm for Lot Sizing Problem

Abstract

결과 모든 데이터에 대해 최적 해를 찾았다. Abstract The lot sizing problem(LSP) is a hard problem that classified as non-deterministic(NP)-complete because of the polynomial-time optimal solution algorithm is unknown yet. The well-known W-W algorithm can be obtain the solution within polynomial-time, but this algorithm is a very complex, therefore the heuristic approximated S-M algorithm is suggested. This paper suggests  linear-time complexity algorithm that can be find not the approximated but optimal solution. This algorithm determines the lot size  ∗ in period  to the sum of the demands of interval   , the period   is determined by the holding cost will not exceed setup cost of   period.