A Loading Problem in Process Type Production

Abstract
Given a set {di} of continuous rates of demand for n products, the associated costs, unit processing times, and set-up times, and given N different types of processors (with possibly more than one processor per type), it is desired to determine the single-stage production pattern under the constraint that only EMQ's are manufactured. An LP is formulated to which we apply the decomposition principle and generate a nonlinear programming problem in integer variables as a subproblem to be generated at each iteration. This subproblem is solved by dynamic programming approach.

This publication has 0 references indexed in Scilit: