A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs
Not on the map. Why?
Abstract (arXiv)
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~|;|~sumUj. Several proofs of the correctness of this algorithm have been published. We present a new short proof.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 13 Apr 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 1.
1 paper.