This site uses different types of cookies, including analytics and functional cookies (its own and from other sites). To change your cookie settings or find out more, click here. If you continue browsing our website, you accept these cookies.
Thanks for the reply - I think (may be wrong) that this problem is easier than the bin packing one as I just require that the two datasets interact with one another e.g.
Dataset 1 : Product 1, Linear space taken up : 20, order of preference : A,B,C
Product 2, Linear space taken up : 30, order of preference, B,A,C
Dataset 2 : Available space : A ; 200, B:250, C:300 --> [product 1 fits in A, so allocate to A]
A : 180, B : 250, C: 300
A : 180, B : 220, C:300
I just need to go down the list of products (in the order I have) and allocate to A,B,C according to 1) is it the highest order of preference, 2) is there space in that choice, if not allocate to 2nd choice ...
If this requires a sample, let me know and i'll post