Moore's Greedy Algorithm for Minimizing the Number of Late Jobs: Structure and Implementation

Dean Matthew Menezes, C. Gregory Plaxton

Scheduling $n$ jobs with deadlines and processing times on a single resource to minimize late jobs equates to finding a maximum-cardinality feasible subset. Moore (1968) proposed a…