Deterministic Production Planning: Algorithms and Complexity

  title={Deterministic Production Planning: Algorithms and Complexity},
  author={Michael Florian and Jan Karel Lenstra and Alexander H. G. Rinnooy Kan},
  journal={Management Science},
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… 
Production planning with time-dependent capacity bounds
Abstract In this paper, we examine the problem of finding minimum-cost production schedules that satisfy known demands over a finite planning horizon. A dynamic programming algorithm is developed to
Requirements Planning with Pricing and Order Selection Flexibility
The key result of this work is a polynomial-time solution approach to the problem under time-invariant finite production capacities and piecewise-linear and concave revenue functions in price.
Models for Integrated Production Planning and Order Selection
The vast body of literature on dynamic requirements planning problems in make-to-order production systems assumes that demands in all periods are predefined. In many practical contexts, however, a
Multifacility in-series production-planning model with capacity constraints
A single-product M facilities in-series production-planning model is analysed in which known demands on the last facility must be satisfied and the structure of optimal production schedules is exploited and then used to develop an efficient shortest-path algorithm for the systems with parallel production (inventory) cost functions.
A new heuristic for capacitated single stage production planning
Thís paper develops a new heuristic approach for the capacitated single machine lot-sizing problem, incorporating more realistic features such as production and storage capacities, as well as
The Design of an Hierarchical Model for Production Planning and Scheduling
In this paper, the design of an hierarchical model for production planning and scheduling is discussed in a real-life case study and heuristic solution procedures are developed for all sub-problems.
Operational production planning in a chemical manufacturing environment
A heuristic for operational production planning in a chemical processing environment, characterized by a single bottleneck machine, fixed batch sizes, sequence-dependent setup times, as well as production and storage capacity constraints, is developed.
A polynomial time algorithm for production planning with bounded inventory
In petrochemical manufacturing, food processing, glass manufacturing, etc., there is a situation where the production planning is subject to the limit of inventory capacity (or bounded inventory)
Fast Generation of Production Schedules on a Single Machine
An extremely fast and simple method is presented for finding a "good" initial schedule in the case of a continuous-time single machine problem with the goal of minimizing setup and holding costs.
On the Stochastic Non-sequential Production-planning Problem
This paper examines a stochastic non-sequential capacitated production-planning problem where the demand of each period is a continuous random variable. The stochastic non-sequential


A multi-period single commodity production planning problem is studied in which known requirements have to be satisfied. The model differs from earlier well-known studies involving concave cost
Sequential Production Planning Over Time at Minimum Cost
Production of a given commodity is to be scheduled over time to meet known future requirements while minimizing total costs. The costs include both storage and production costs as functions of time.
Production Planning with Convex Costs: A Parametric Study
We consider the problem of choosing the amounts of a single product to produce in each of a finite number of time periods so as to minimize the (convex) production and (convex) inventory carrying
A capacity constrained single-facility dynamic lot-size model
Abstract A computationally efficient algorithm for a multi-period single commodity production planning problem with capacity constraints is developed. The model differs from earlier well-known
An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
We consider the situation of a single item having a deterministic, time-varying demand pattern. Production lot sizes, so as to minimize the total of setup and carrying costs, are to be determined
Bounded Production and Inventory Models with Piecewise Concave Costs
An n period single-product single-facility model with known requirements and separable piecewise concave production and storage costs is considered. It is shown using network flow concepts that for
Minimum‐cost flows in convex‐cost networks
Abstract : An algorithm is given for solving minimum-cost flow problems where the shipping cost over an arc is convex function of the number of units shipped along that arc. This provides a unified
A Deterministic Multi-Period Production Scheduling Model with Backlogging
A deterministic multi-period production and inventory model that has concave production costs and piecewise concave [Zangwill, W. I. 1965. A dynamic multi-product, multi-facility production and
On the Computational Complexity of Combinatorial Problems
  • R. Karp
  • Computer Science
  • 1975
A large class of classical combinatorial problems, including most of the difficult problems in the literature of network flows and computational graph theory, are shown to be equivalent, in the sense
A Class of Nonlinear Integer Programs Solvable by a Single Linear Program
Although the addition of integrality constraints to the existing constraints of an optimization problem will, in general, make the determination of an optimal solution more difficult, we consider