Making schedules in multiprocessing systems with several additional resources

详细

The problem of making a feasible schedule in a preemptive multiprocessing system with identical processors and several types of additional recourses is considered in the case when the task execution intervals are given and the durations of task execution linearly depend on the amount of the additional resource allocated to them. Algorithms based on reducing this problem to a network flow problem and a system of linear constraints are developed.