Problemcore
Minimizing the number of tardy jobs
Also called 1||sum Uj, Moore's problem.
Maximize the number of jobs that meet their due dates.
Maximize the number of jobs that meet their due dates.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 192FEE Edit this page History Report an error