This paper considers a dynamic lot-sizing problem with storage capacity limitation in which backlogging is allowed. For general concave production and inventory costs, we present an O(T2) dynamic programming algorithm where T is the length of the planning horizon. Furthermore, for fixed-charge...