Bounds for LPT Schedules on Uniform Processors 论文
1977SIAM Journal on Computing引用 287
Scheduling and Optimization AlgorithmsDistributed and Parallel Computing SystemsReal-Time Systems Scheduling
摘要
We study the performance of LPT (largest processing time) schedules with respect to optimal schedules in a nonpreemptive multiprocessor environment. The processors are assumed to have different speeds and the tasks being scheduled are independent.