1. Assmann, S.F., Johnson, D.S., Kleitman, D.J., Leung, J.Y.-T.: On a dual version of the one-dimensional bin packing problem. J. Algorithms 5(4), 502–525 (1984)
2. Bar-Noy, A., Ladner, R.E., Tamir, T.: Windows scheduling as a restricted version of bin packing. In: SODA’04: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 224–233. Society for Industrial and Applied Mathematics, Philadelphia (2004)
3. Boyar, J., Epstein, L., Favrholdt, L.M., Kohrt, J.S., Larsen, K.S., Pedersen, M.M., Wøhlk, S.: The maximum resource bin packing problem. Theor. Comput. Sc. 362(1–3), 127–139 (2006)
4. Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Approximation Algorithms for NP-Hard Problems, pp. 46–93. PWS, Boston (1997)
5. Csirik, J.: The parametric behavior of the first-fit decreasing bin packing algorithm. J. Algorithms 15(1), 1–28 (1993)