Computer Science (Jan 1999)
Optimistic and Pessimistic Result of Planning and Scheduling Dynamic Processes
Abstract
The combinatorial optimization is aimed at finding the optimum sequence for a given form of the performance index. This paper deals with the problems of combinatorics optimization. Here are set forth three forms of the performance index for the optimization tasks. We can consider the scheduling problem. The loss of the profit depends on the resources volume. Special attention is paid at finding polynomial algorithms used for combinatorics optimization tasks. Those optimization tasks may be solved for a large number of dynamic processes. The optimization algorithms set forth are based upon the sorting procedure. The performance index is assumed to be additive. The performance index value, after having completed a number of dynamic processes determines the initial condition for the successive dynamic problem under realization. In real physical or economic processes it is necessary to know a determined time interval for carrying out the elementary technical, technological or economic operation.
