Probabilistic Bounds on the Performance of List Scheduling
- 1 May 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 15 (2) , 409-417
- https://doi.org/10.1137/0215028
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On the Expected Relative Performance of List SchedulingOperations Research, 1985
- A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two ProcessorsMathematics of Operations Research, 1984
- Distribution Theory for Tests Based on the Sample Distribution FunctionPublished by Society for Industrial & Applied Mathematics (SIAM) ,1973
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- Table of Percentage Points of Kolmogorov StatisticsJournal of the American Statistical Association, 1956
- One-Sided Confidence Contours for Probability Distribution FunctionsThe Annals of Mathematical Statistics, 1951