1. Baker, B. S., A new proof for the first-fit decreasing bin packing algorithm, J. Algorithms, 6 (1985), 49–70.
2. Coffman, E. G., Garey, M. R. and Johnson, D. S., Approximation algorithms for bin packing: A survey. In: Hochbaum, D. ed., Approximation Algorithms for NP-hard Problems, PWS Publishing Company, Boston, 1996, 46–93.
3. Garey, M. R. and Johnson, D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
4. Johnson, D. S., Near-optimal bin packing algorithms, PhD thesis, Department of Mathematics, IMT, Cambridge, 1973.
5. Lenstra, J. K. and Shmoys, D. B., Computing near-optimal schedules. In: Chrétienne, P. et al. eds., Scheduling Theory and Its Applications, John Wiley & Sons Ltd., Chichester, 1995, 1–14.