The black and white bin packing problem is a variant of the classical bin packing problem, where in addition to a size, each item also has a color black or white, and in each bin the colors of items must alternate. The problem has been studied extensively, but the best competitive online algorithm has competitiveness of 3. The competitiveness of 3 can be forced even when the sizes of items are 'halved', i.e.i¾?the sizes are restricted to be in 0,i¾?1i¾?/i¾?2]. We give the first 'better than 3' competitive algorithm for the problem for the case that item sizes are in the range 0,i¾?1i¾?/i¾?2]; our algorithm has competitiveness $$\frac{8}{3}$$83.
['Jing Chen', 'Xin Han', 'Wolfgang W. Bein', 'Hing-Fung Ting']
Black and White Bin Packing Revisited