<s>
The	O
multifit	B-Algorithm
algorithm	I-Algorithm
is	O
an	O
algorithm	O
for	O
multiway	B-Algorithm
number	I-Algorithm
partitioning	I-Algorithm
,	O
originally	O
developed	O
for	O
the	O
problem	O
of	O
identical-machines	B-Algorithm
scheduling	I-Algorithm
.	O
</s>
<s>
Multifit	O
is	O
a	O
constant-factor	B-Algorithm
approximation	I-Algorithm
algorithm	I-Algorithm
.	O
</s>
<s>
During	O
the	O
MultiFit	B-Algorithm
algorithm	I-Algorithm
,	O
the	O
lower	O
bound	O
L	O
is	O
always	O
a	O
capacity	O
for	O
which	O
it	O
is	O
impossible	O
to	O
pack	O
S	O
into	O
n	O
bins	O
.	O
</s>
<s>
After	O
the	O
MultiFit	B-Algorithm
algorithm	I-Algorithm
runs	O
for	O
k	O
iterations	O
,	O
the	O
difference	O
shrinks	O
k	O
times	O
by	O
half	O
,	O
so	O
.	O
</s>
<s>
MultiFit	O
can	O
also	O
be	O
used	O
in	O
the	O
more	O
general	O
setting	O
called	O
uniform-machines	B-Algorithm
scheduling	I-Algorithm
,	O
where	O
machines	O
may	O
have	O
different	O
processing	O
speeds	O
.	O
</s>
<s>
When	O
MultiFit	O
is	O
combined	O
with	O
the	O
LPT	B-Algorithm
algorithm	I-Algorithm
,	O
the	O
ratio	O
improves	O
to	O
.	O
</s>
<s>
Modifications	O
of	O
MULTIFIT	O
can	O
be	O
devised	O
which	O
would	O
be	O
more	O
suitable	O
for	O
our	O
problem	O
,	O
but	O
we	O
could	O
find	O
none	O
which	O
produces	O
a	O
better	O
worst-case	O
bound	O
than	O
that	O
of	O
LPT.	O
"	O
</s>
<s>
Multifit	O
has	O
been	O
extended	O
to	O
the	O
more	O
general	O
problem	O
of	O
maximin-share	B-Algorithm
allocation	O
of	O
chores	O
.	O
</s>
<s>
A	O
naive	O
approach	O
is	O
to	O
let	O
each	O
agent	O
in	O
turn	O
use	O
the	O
MultiFit	B-Algorithm
algorithm	I-Algorithm
to	O
calculate	O
the	O
threshold	O
,	O
and	O
then	O
use	O
the	O
algorithm	O
where	O
each	O
agent	O
uses	O
his	O
own	O
threshold	O
.	O
</s>
