The Single-Plant Mold Allocation Problem with Capacity and Changeover Restrictions

This paper presents a formulation and a solution technique for a class of production scheduling problems. Plant capacity limitations and changeover restrictions characterize the problems in this class. A member of this class, called the single-plant mold allocation problem, is formulated as a linear integer programming problem. We develop a transformation that permits the reduction of this problem to a minimum cost flow problem.