<s>
A	O
constructive	B-Algorithm
heuristic	I-Algorithm
is	O
a	O
type	O
of	O
heuristic	B-Algorithm
method	O
which	O
starts	O
with	O
an	O
empty	O
solution	O
and	O
repeatedly	O
extends	O
the	O
current	O
solution	O
until	O
a	O
complete	O
solution	O
is	O
obtained	O
.	O
</s>
<s>
It	O
differs	O
from	O
local	B-Algorithm
search	I-Algorithm
heuristics	B-Algorithm
which	O
start	O
with	O
a	O
complete	O
solution	O
and	O
then	O
try	O
to	O
improve	O
the	O
current	O
solution	O
further	O
via	O
local	O
moves	O
.	O
</s>
<s>
Examples	O
of	O
some	O
famous	O
problems	O
that	O
are	O
solved	O
using	O
constructive	B-Algorithm
heuristics	I-Algorithm
are	O
the	O
flow	B-Algorithm
shop	I-Algorithm
scheduling	I-Algorithm
,	O
the	O
vehicle	B-Algorithm
routing	I-Algorithm
problem	I-Algorithm
and	O
the	O
open	O
shop	O
problem	O
.	O
</s>
