1. N. Alon, Y. Azar, G. Woeginger, T. Yadid, Approximation schemes for scheduling, in: Proceedings of the Eighth ACM/SIAM Symposium on Discrete Algorithms, ACM Press, 1997, 493–500
2. Worst-case analysis of a placement algorithm related to storage allocation;Chandra;SIAM Journal on Computing,1975
3. D. Coffman, E. Luecker, Probabilistic Analysis of Packing and Partitioning Algorithms, Wiley, New York, 1991
4. M.R. Garey, D.S. Johnson, Computers and Intractability, W.H. Freeman and Company, New York, 1979
5. P.E. Gill, W. Murray, M.H. Wright, Practical Optimization, Academic Press, New York, 1991