Showing 1 - 10 of 10
Given a finite set of spheres of different sizes, we study the three-dimensional Strip Packing Problem (3D-SPP) as well as the three-dimensional Knapsack Problem (3D-KP). The 3D-SPP asks for a placement of all spheres within a cuboidal strip of fixed width and height so that the variable length...
Persistent link: https://www.econbiz.de/10009395545
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...
Persistent link: https://www.econbiz.de/10009138323
Persistent link: https://www.econbiz.de/10008906881
Persistent link: https://www.econbiz.de/10009312685
Persistent link: https://www.econbiz.de/10009419047
Persistent link: https://www.econbiz.de/10009348507
Persistent link: https://www.econbiz.de/10009818442
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...
Persistent link: https://www.econbiz.de/10011052644
Persistent link: https://www.econbiz.de/10008968851
Persistent link: https://www.econbiz.de/10009362797