  The Moore-Hodgson Algorithm minimizes the number of late jobs on a single
machine. That is, it finds an optimal schedule for the classical problem
$1~|\;|~\sum{U_j}$. Several proofs of the correctness of this algorithm have
been published. We present a new short proof.
