TY - GEN
A1 - Dzemyda, Gintautas
A2 - Korbicz, Józef - red.
A2 - Uciński, Dariusz - red.
PB - Zielona Góra: Uniwersytet Zielonogórski
N2 - Results of this paper extend the set of criteria which characterize the scheduling quality as well as the set of possible scheduling strategies. A new view on the minimum makespan criterion is presented in terms of the mean squared load of processing units.
N2 - This leads in turn to the development of new scheduling algorithms. The interaction between processes of minimizing the new criteria and the maximum finishing time (makespan of the schedule) was discovered.
N2 - We show the possibility of minimizing the maximum finishing time by minimizing the new criteria that characterize the mean squared load of processing units. Moreover, the optimal workload of processing units determined with the use of the proposed criteria is usually smoother (more balanced) than that found for traditional ones.
L1 - http://www.zbc.uz.zgora.pl/Content/58311/AMCS_1999_9_4_12.pdf
L2 - http://www.zbc.uz.zgora.pl/Content/58311
KW - parallel processing
KW - scheduling
KW - combinatorial problems
KW - minimum makespan problem
KW - mean squared load
T1 - Mean squared load criteria for scheduling independent tasks
UR - http://www.zbc.uz.zgora.pl/dlibra/docmetadata?id=58311
ER -