Bortfeldt, Andreas; Forster, Florian - In: European Journal of Operational Research 217 (2012) 3, pp. 531-540
In the container pre-marshalling problem (CPMP) n items are given that belong to G different item groups (g=1,…,G) and that are piled up in up to S stacks with a maximum stack height H. A move can shift one item from one stack to another one. A sequence of moves of minimum length has to be...