Scheduling computational process on the basis of ranked models and CPL criterion functions
Leon Bobrowski · Annual Conference on Computers · 2008
Scheduling procedures allow to determine the order of realization of particular tasks of a given complex process. The order of such tasks can be represented as a ranked relation between some of them. Ranked models have the form of linear transformations of multivariate feature vectors on a line which preserve in a satisfactory manner a given set of ranked relations between components. The linear ranked transformations can be designed through minimization of adequate CPL criterion functions. Theoretical properties of this approach to scheduling and their applications are discussed in the paper.