SEQUENTIAL OPTIMIZATION IN ONE SCHEDULING PROBLEM.

The sequential optimization problem is defined as minimizing the time required to complete the entire set of operations (or, what is the same thing, the set of jobs representing these operations) for currently available resources, and choosing from the set of these solutions the best one in the sense, for example, of the ″cost of the solution″ ; if there are several of these solutions too, then the best of them (taking into account other considerations) must be chosen. This paper examines two problems of the distribution of limited resources - sequential optimization with three criteria (F//1, F//2, F//3) concerning optimality of the problem solution (criteria of different priorities), and minimization of the resources sufficient to complete the entire set of operations, with a required date for finishing the entire set of operations. Examples are given.