Resource Constrained Scheduling as Generalized Bin Packing

[1]  David S. Johnson,et al.  Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..

[2]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[3]  Chak-Kuen Wong,et al.  Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation , 1975, SIAM J. Comput..

[4]  Ronald L. Graham,et al.  Bounds for Multiprocessor Scheduling with Resource Constraints , 1975, SIAM J. Comput..

[5]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[6]  Andrew Chi-Chih Yao,et al.  Scheduling Unit-Time Tasks with Limited Resources , 1974, Sagamore Computer Conference.

[7]  David S. Johnson,et al.  Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..

[8]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[9]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[10]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[11]  T. C. Hu.  Parallel Sequencing and Assembly Line Problems , 1961 .

[12]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[13]  David S. Johnson,et al.  Near-optimal bin packing algorithms , 1973 .

[14]  Kenneth Leroy Krause,et al.  Analysis of computer scheduling with memory constraints. , 1973 .

[15]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.