A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors
暂无分享,去创建一个
E. G. Coffman | G. N. Frederickson | G. S. Lueker | E. Coffman | G. Frederickson | Edward G. Coffman | Greg N. Frederickson | George S. Lueker
[1] Micha Hofri,et al. A Stochastic Model of Bin-Packing , 1980, Inf. Control..
[2] Edward G. Coffman,et al. Algorithms minimizing mean flow time: schedule-length properties , 1976, Acta Informatica.
[3] Edward G. Coffman,et al. A generalized bound on LPT sequencing , 1976, SIGMETRICS '76.
[4] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.
[5] N. Karmarkar. Probabilistic analysis of some bin-packing problems , 1982, FOCS 1982.
[6] P. A. P. Moran,et al. An introduction to probability theory , 1968 .
[7] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .
[8] David S. Johnson,et al. Approximation Algorithms for Bin Packing Problems: A Survey , 1981 .
[9] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .