일상적인 납기구간 롯사이징 문제에 대한 O(nT) 알고리듬

초록

This paper considers the dynamic lot-sizing problem with agreeable time window. In agreeable time window structure in which each time window does not superimpose other time windows. For fixed and linear replenishment costs, we propose a dynamic programming algorithm with running time of O(nT) where n is the number of demands and T is the length of the planning horizon.

키워드