In this paper, we consider a class of single-item dynamic lot-sizing problem with quantity discount cost structure. We present an optimal polynomial algorithm for the case of multi-breakpoint N i , i = 1, 2,. .. , m. The complexity of our algorithm is O(n 3 + mn 2), where n is the number of periods in finite planning horizon.
An Economic Lot-sizing(ELS) problem with perishable inventory has been studied extensively over the years and plays a fundamental role in the inventory management. In this paper, we consider the problem where backlogging is allowed with the general economies of scale cost functions. Since the special case without backlogging is NP-hard, the considered… (More)