Batched bin packing

D.J. Brown, A lower bound for on-line one-dimensional bin packing algorithms, Technical Report R-864, Coordinated Science Laboratory, Urbana, IL, 1979. Chandra, 1992, Does randomization help in on-line bin packing?, Inform. Process. Lett., 43, 15, 10.1016/0020-0190(92)90023-O Coffman, 1999, Bin packing approximation algorithms, 151 Coffman, 1996, Approximation Algorithms for bin packing, 46 J. Csirik, G. Woeginger, On-line packing and covering problems, in: A. Fiat, G. Woeginger (Eds.), On-line Algorithms—The State of the Art, Lecture Notes in Computer Science, vol. 1442, Springer, New York, 1998, pp. 147–177. Diestel, 2000 Faigle, 1989, On the performance of on-line algorithms for partition problems, Acta Cybernet., 9, 107 Galambos, 1993, Repacking helps in bounded space on-line bin-packing, Computing, 49, 329, 10.1007/BF02248693 E.F. Grove, Online bin packing with lookahead, Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 430–436. G. Gutin, T. Jensen, A. Yeo, Optimal on-line bin packing with two item sizes, submitted. Ivković, 1997, Partially dynamic bin packing can be solved within 1+ε in (amortized) polylogarithmic time, Inform. Process. Lett., 63, 45, 10.1016/S0020-0190(97)00092-6 Ivković, 1998, Fully dynamic algorithms for bin packing, SIAM J. Comput., 28, 574, 10.1137/S0097539794276749 Lee, 1985, A simple on-line packing algorithm, J. ACM, 32, 562, 10.1145/3828.3833 Liang, 1980, A lower bound for online bin packing, Inform. Process. Lett., 10, 76, 10.1016/S0020-0190(80)90077-0 van Vliet, 1992, An improved lower bound for online bin packing algorithms, Inform. Process. Lett., 43, 277, 10.1016/0020-0190(92)90223-I Yao, 1980, New algorithms for bin packing, J. ACM, 27, 207, 10.1145/322186.322187 Zhang, 2001, An on-line bin batching problem, Discrete Appl. Math., 108, 329, 10.1016/S0166-218X(00)00243-2 Zhang, 2003, Scheduling two groups of jobs with incomplete information, J. System Sci. Systems Eng., 12, 73, 10.1007/s11518-006-0121-y