SIAM Journal on Computing · 1977 · 287 citations · 8 references
ComputingComputer EngineeringComputer ScienceSchedulingCpu SchedulingMachine SchedulingNon-preemptive SchedulingScheduling TheoryTask SchedulingMultiprocessor SchedulabilityMultiprocessor SchedulingScheduling In Multiprocessor Systems
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.
8
Bounds on Multiprocessing Timing Anomalies
Ron Graham · SIAM Journal on Applied Mathematics · 1969 · 2.4K citations
Algorithms for Scheduling Independent Tasks
Sartaj Sahni · Journal of the ACM · 1976 · 593 citations · Full text
Scheduling independent tasks to reduce mean finishing time
John Bruno, E. G. Coffman, Ravi Sethi · Communications of the ACM · 1974 · 500 citations · Full text