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