Top · 2001 · 14 citations · 17 references
ComputingComputer EngineeringComputer ScienceAlgorithmsParallel ComputingSchedulingCpu SchedulingMachine SchedulingMakespan MinimizationParallel Algorithm DesignParallel Computing SystemsTask SchedulingIdentical Parallel Machine SchedulingMakespan OptimizationParallel Machine Makespan Minimization
17
The complexity of theorem-proving procedures
Stephen Cook · 1971 · 6.2K citations · Full text
Bounds on Multiprocessing Timing Anomalies
Ron Graham · SIAM Journal on Applied Mathematics · 1969 · 2.4K citations
Bounds for Certain Multiprocessing Anomalies
Ronald Graham · Bell System Technical Journal · 1966 · 1.6K citations
S. S. Panwalkar, Wafik H. Iskander · Operations Research · 1977 · 1.3K citations
Scheduling with Deadlines and Loss Functions
Robert McNaughton · Management Science · 1959 · 846 citations