A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs
arXiv:2104.06210
Abstract
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 . Several proofs of the correctness of this algorithm have been published. We present a new short proof.
3 pages