This paper is concerned with the single-product dynamic lot size model. Let n be the number of periods in the planning horizon. In 1958 Wagner and Whitin proposed an O(n^2) time algorithm for the model. We consider the case of the model in which the c...
This paper is concerned with the single-product dynamic lot size model. Let n be the number of periods in the planning horizon. In 1958 Wagner and Whitin proposed an O(n^2) time algorithm for the model. We consider the case of the model in which the cost function satisfies the quadrangle inequality, and present a single forward algorithm which solves the case in O(n log n) time.