Forster, Florian; Bortfeldt, Andreas - Fernuniversität <Hagen> / Lehrstuhl für … - 2010
In the container relocation problem (CRP) n items are given that belong to G different itemgroups (g = 1,…,G). The items are piled up in up to S stacks with a maximum stack height H.A move can either shift one item from the top of a stack to the top of another one (relocation)or pick an item...
