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 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.

• 저널Management Science · 26(7) · 669–679
• 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.26.7.669
• 저자Michaël Florian, Jan Karel Lenstra, A. H. G. Rinnooy Kan