Algorithms for Scheduling Independent Tasks
暂无分享,去创建一个
[1] J. R. Jackson. SCHEDULING A PRODUCTION LINE TO MINIMIZE MAXIMUM TARDINESS , 1955 .
[2] Journal of the Association for Computing Machinery , 1961, Nature.
[3] William L. Maxwell,et al. Theory of scheduling , 1967 .
[4] J. M. Moore,et al. A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .
[5] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.
[6] Edward G. Coffman,et al. Algorithms for Minimizing Mean Flow Time , 1974, IFIP Congress.
[7] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[8] Sartaj Sahni,et al. Computationally Related Problems , 1974, SIAM J. Comput..
[9] Ellis Horowitz,et al. Computing Partitions with Applications to the Knapsack Problem , 1974, JACM.
[10] Teofilo F. Gonzalez,et al. P-Complete Problems and Approximate Solutions , 1974, SWAT.
[11] Edward G. Coffman,et al. Scheduling independent tasks to reduce mean finishing time , 1974, CACM.
[12] Oscar H. Ibarra,et al. Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.
[13] Sartaj Sahni,et al. Approximate Algorithms for the 0/1 Knapsack Problem , 1975, JACM.
[14] Jeffrey D. Ullman,et al. NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..
[15] Edward G. Coffman,et al. Algorithms minimizing mean flow time: schedule-length properties , 1976, Acta Informatica.