# A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs

arXiv: https://arxiv.org/abs/2104.06210 · HTML: https://mlsanity.com/paper/2104.06210/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 13 Apr 2021.

## Built on by (most cited first, 1 of 1)

- [Prism: Cost-Efficient Multi-LLM Serving via GPU Memory Ballooning](https://mlsanity.com/paper/2505.04021/) (2025)

## 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.