Deterministic Production Planning: Algorithms and Complexity

摘要

A class of production planning problems is considered in which known demands have to be satisfied over a finite interval at minimum total costs. For each period, production and storage cost functions are specified. The production costs may include setup costs and the production levels may be subject to capacity limits. The computational complexity of the problems in this class is investigated. Several algorithms proposed for their solution are described and analyzed. It is also shown that some special cases are NP-hard and hence unlikely to be solvable in polynomial time.