Deterministic Production Planning: Algorithms and Complexity

Publisher Website
Google Scholar
Abstract
A class of production planning problems is considered in which known demands have to be satisfied over a finite horizon at minimum total costs. For each period, production and storage cost functions are specified. The production costs may include set-up costs and the production levels may he 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.inventory/production: deterministic models, inventory/production: surveys, dynamic programming: deterministic, discrete time

This publication has 0 references indexed in Scilit: