We develop an algorithm that solves the constant capacities economic lot-sizing problem with concave production costs and linear holding costs in O(T³) time. The algorithm is based on the standard dynamic programming approach which requires the computation of the minimal costs for all possible...

We develop an algorithm that solves the constant capacities economic lot-sizing problem with concave production costs and linear holding costs in O(T³) time. The algorithm is based on the standard dynamic programming approach which requires the computation of the minimal costs for all possible...

We report new results for a time-indexed formulation of nonpreemptive single- machine scheduling problems. We give complete characterizations of all facet induc- ing inequalities with integral coecients and right-hand side 1 or 2 for the convex hull of the set of feasible partial schedules,...

NP-hard cases of the single-item capacitated lot-sizing problem have been the topic of extensive research and continue to receive considerable attention. However, surprisingly few theoretical results have been published on approximation methods for these problems. To the best of our knowledge,...