Online Bin Coloring
Abstract: We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored items into bins, such that the maximum number of different colors per bin is minimized. Each bin has size B ∈ ℕ. The packing process is subject to the constraint that at any moment in time at most q ∈ ℕ bins are partially filled. Moreover, bins may only be closed if they are filled completely. An online algorithm must pack each item without knowledge of any future items.
Loading