1. Arkin, E., Hassin, R.: On local search for weighted packing problems. Mathematics of Operations Research 23, 640–648 (1998)
2. Baker, B.S., Coffman Jr., E.G.: A tight asymptotic bound for next-fit-decreasing bin-packing. SIAM J. on Algebraic and Discrete Methods 2(2), 147–152 (1981)
3. Coffman Jr., E.G., Csirik, J., Leung, J.: Variants of classical bin packing. In: Gonzalez, T.F. (ed.) Approximation algorithms and metaheuristics. Chapman and Hall/CRC (to appear)
4. Crescenzi, P., Kann, V., Halldórsson, M.M., Karpinski, M., Woeginger, G.J.: A compendium of NP optimization problems,
http://www.nada.kth.se/viggo/problemlist/compendium.html
5. de Werra, D.: An introduction to timetabling. European Journal of Operational Research 19, 151–162 (1985)