Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling
暂无分享,去创建一个
[1] M. L. Fisher,et al. Probabilistic Analysis of the Planar k-Median Problem , 1980, Math. Oper. Res..
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] P. Hoel,et al. Introduction to Mathematical Statistics. Second Edition. , 1955 .
[4] B. J. Lageweg,et al. Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems , 1983, Math. Oper. Res..
[5] W. Feller,et al. An Introduction to Probability Theory and its Applications, Vol. II , 1967 .
[6] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1951 .
[7] Edward G. Coffman,et al. An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..
[8] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.
[9] Richard M. Karp,et al. Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..
[10] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .
[11] E. G. Coffman,et al. A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors , 1984, Math. Oper. Res..