SIAM Journal on Computing · 1978 · 660 citations · 4 references
ComputingComputer EngineeringComputer ScienceAlgorithmsParallel ComputingSchedulingCpu SchedulingResource SchedulingScheduling TheoryTask SchedulingBin PackingBin Packing ApproximationBin Packing ProblemMultiprocessor SchedulingParallel SchedulingParallel Scheduling AlgorithmsScheduling ApproximationScheduling In Multiprocessor Systems
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 28 September 1976Published online: 13 July 2006Keywordsbin packing, multiprocessor scheduling, approximation algorithms, worst-case analysis, performance boundsPublication DataISSN (print): 0097-5397ISSN (online): 1095-7111Publisher: Society for Industrial and Applied MathematicsCODEN: smjcat
4
Bounds on Multiprocessing Timing Anomalies
Ron Graham · SIAM Journal on Applied Mathematics · 1969 · 2.4K citations
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
D. S. Johnson, Alan Demers, Jeffrey D. Ullman et al. · SIAM Journal on Computing · 1974 · 913 citations
Algorithms for Scheduling Independent Tasks
Sartaj Sahni · Journal of the ACM · 1976 · 593 citations · Full text