Aggregated volume/time planning models for one class of discrete production systems

We consider an operational scheduling problem for one class of discrete production systems. The volumetric characteristics of the schedule must be optimal according to the criterion that includes aggregated time constraints. We propose to solve this problem in two stages. The first one is finding an aggregated plan that corresponds to one of the original aggregated volume/time models proposed by the authors. The second stage is the disaggregation of the obtained optimal aggregated plan (that includes aggregated time constraints) converting it into an operational schedule. The implementation of the second stage is not considered in this paper. We have proposed a number of linear models which differ both in the number of constraints and variables and in the methods of their solution, as linear programming problems. The proposed models are generalized in the case of the need to find a compromise solution with respect to a set of possibly antagonistic linear criteria in a deterministic formulation and in uncertainty conditions. Ref. 17.