References
- Alon , N. , Azar , Y. , Woeginger , G. and Yadid , T. 1997 . “ Approximation schemes for scheduling ” . In Proc. 8th ACM/SIAM Symposium on Discrete Algorithms , 493 – 500 . ACM Press .
- Chandra , A. K. and Wong , C. K. 1975 . Worst-case analysis of a placement algorithm related to storage allocation . SIAM Journal on Computing , 4–3 : 249 – 263 .
- Coffman , D. and Luecker , E. 1991 . Probabilistic Analysis of Packing and Partitioning Algorithms , New York : John Wiley & Sons .
- Garey , M. R. and Johnson , D. S. 1979 . Computers and Intractability , New York : W. H. Freeman and Company .
- Gill , P. E. , Murray , W. and Wright , M. H. 1991 . Practical Optimization , New York : Academic Press .
- Goldberg , R. , Shapiro , J. and Waxman , J. 1997 . Approximation Algorithm for the Partition Problem . Congressus Numerantium , 108 : 141 – 151 .
- Graham , R. L. 1969 . Bounds on multiprocessing timing anomalies . SIAM J. Appl. Math , 17 : 263 – 269 .
- Hall , L. A. 1997 . “ Approximation algorithms for scheduling ” . In Approximation algorithms for NP-hard problems , Edited by: Hochbaum , D. S. 1 – 45 . PWS Publishing Co .
- Leung , J. Y. T. and Wei , W. D. 1995 . Tighter bounds on a heuristic for a partition problem . Information Processing Letters , 56 : 51 – 57 .