<s>
The	O
modified	O
due-date	O
(	O
MDD	O
)	O
scheduling	O
heuristic	O
is	O
a	O
greedy	B-Algorithm
heuristic	I-Algorithm
used	O
to	O
solve	O
the	O
single	O
machine	O
total	O
weighted	O
tardiness	O
problem	O
(	O
SMTWTP	O
)	O
.	O
</s>
<s>
This	O
heuristic	O
works	O
the	O
same	O
way	O
as	O
other	O
greedy	B-Algorithm
algorithms	I-Algorithm
.	O
</s>
<s>
MDD	O
is	O
similar	O
to	O
the	O
earliest	B-Algorithm
due	I-Algorithm
date	I-Algorithm
(	O
EDD	O
)	O
heuristic	O
except	O
that	O
MDD	O
takes	O
into	O
account	O
the	O
partial	O
sequence	O
of	O
job	O
that	O
have	O
been	O
already	O
constructed	O
,	O
whereas	O
EDD	O
only	O
looks	O
at	O
the	O
jobs	O
 '	O
due	O
dates	O
.	O
</s>
