Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Online Bin-coloring Online Bin-coloring

We introduce a new problem that was motivated by a (more comp licated) problem arising in a robotized assembly environment. The bin coloring problemis to pack unit size colored items into bins, such that the maximum numb er of different colors per bin is minimized. Each bin has size B 2 N. The packing process is subject to the constraint that at any moment… (More)