We continue the study of two recently introduced bin packing type problems, called with clustering, and online delays. A input consists items sizes not larger than 1, goal is to partition or pack them into bins, where total size every valid cannotexceed 1. In also have colors associated them. globally optimal solution can combine different while a clustered only monochromatic bins. The compare ...