Bin Packing (1-D)

These slides on 1-D bin packing

are adapted from slides from

Professor C. L. Liu
former President (1998-2002)
Tsing Hua University,
Hsinchu, Taiwan).
 Bin Packing (1-D)

Bin Packing Problem The bins;

(capacity 1)

1 ……

.5 .7 .5 .2 .4 .2 .5 .1 .6
.2 .4 .2 .1
.5 .5 .5 .6
.7

Items to be packed
 Bin Packing (1-D)

Bin Packing Problem

1 ……

.5 .7 .5 .2 .4 .2 .5 .1 .6

Optimal Packing
.1
.5 .2
.5
.6 N0 = 4
.5 .7
.4
.2
 Next Fit Packing
Algorithm
Bin Packing Problem
.5 .7 .5 .2 .4 .2 .5 .1 .6
.1
.5 .2
.5
.6 N0 = 4
.5 .7
.4
.2

Next Fit Packing Algorithm

.2 .1
.2
.7 .6
.5 .5 .4 .5

N N=6
2
N0
 Bin Packing (1-D)

Approximation Algorithms:
Not optimal solution,
but with some performance guarantee
(eg, no worst than twice the optimal)

Even though
we don’t know what the optimal solution is!!!
 Next Fit Packing
Algorithm

ai-1 aj-1 ak-1 am-1

.. ..
..
. . .
..
. … ..
.
..
.
a1 ai aj ak al am

a1+……..+ ai > 1 Let a1+ a2 + …….. = 

ai+……..+ aj > 1 2  N–1
aj+……..+ ak > 1
N0    N  1 ≈
N
.. 2 2
..
. N
al+……..+ am > 1 2
N 0
 Next Fit Packing
Algorithm (simpler proof)

ai-1 aj-1 ak-1 am-1

.. ..
..
. . .
..
. … ..
.
..
.
a1 ai aj ak al am

s(B1)+s(B2) > 1
s(B2)+s(B3) > 1
… … … … …
Let a1+ a2 +. … = 
.. s(BN-1)+s(BN) > 1
2 > N– 1..
2N0  2  N – 1 2( s(B1)+s(B2)+…+ s(BN) ) > N – 1
 First Fit Packing
Algorithm
.5 .7 .5 .2 .4 .2 .5 .1 .6
Next Fit Packing Algorithm

.2 .1
.2
.7 .6
.5 .5 .4 .5

First Fit Packing Algorithm

.1
.5 .2

.2
.7 .6
.5 .4 .5

N=5
N
 1.7 (Proof omitted)
N0