0% found this document useful (0 votes)
93 views

Full Bin Algorithm

1. The aim is to pack boxes into bins with the maximum height filled to optimize space. 2. The steps are to look for box combinations that fill the bin height, pack those boxes, and place remaining boxes in open slots starting with the lowest empty bin that can accommodate the box size. 3. The example shows packing boxes of various heights (4, 2, 4, 6, etc.) into bins with a 10 height maximum using this process, resulting in 4 full bins.

Uploaded by

Nurul Hafiqah
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
93 views

Full Bin Algorithm

1. The aim is to pack boxes into bins with the maximum height filled to optimize space. 2. The steps are to look for box combinations that fill the bin height, pack those boxes, and place remaining boxes in open slots starting with the lowest empty bin that can accommodate the box size. 3. The example shows packing boxes of various heights (4, 2, 4, 6, etc.) into bins with a 10 height maximum using this process, resulting in 4 full bins.

Uploaded by

Nurul Hafiqah
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Disediakan oleh: Nurul Farahana Binti Mat Zian Nurul Hafiqah Binti Baharudin Nurul Nadia Binti Azmi

Aim
to have as many full bins as is possible for the list

provided.

Steps:
Look for combinations of boxes to fill bins. 2. Pack these boxes. 3. For the remainder, place the next box to be packed in the first available slot that can take that box.
1.

Example:
Pack the following boxes into bins with maximum

height of 10. Height of boxes:

Steps:
1.

Look for combinations of boxes to fill bins. 4 + 2 + 4 = 10 4 + 6 = 10 5 + 5 = 10 8 + 2 = 10

2. Pack these boxes.


3. For the remainder, place the next box to be packed in

the first available slot that can take that box.


REMAINDER

5 5

4 6

2 8

2 4 4

You might also like