1. Bar-Noy, A., Ladner, R.E., Tamir, T.: Windows scheduling as a restricted version of bin packing. ACM Trans. Algorithms 3(3), 224–233 (2007)
2. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
3. Lecture Notes in Computer Science;W.T. Chan,2005
4. Coffman, E.G. Jr., Courcoubetis, C., Garey, M.R., Johnson, D.S., Shor, P.W., Weber, R.R., Yannakakis, M.: Bin packing with discrete item sizes. Part I: Perfect packing theorems and the average case behavior of optimal packings. SIAM J. Discrete Math. 13, 38–402 (2000)
5. Coffman, E.G. Jr., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: Combinatorial analysis. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization. Kluwer Academic, Dordrecht (1998)