In this paper, we consider a dynamic lot-sizing problem with time windows in which production cost functions are concave. For this problem we present an O(θn²T⁴) pseudo-polynomial time algorithm where n is the number of demands, T is the length of the planning horizon and θ is the total sum of demand requirements.