Problemresearch
Scheduling with rejection
Also called prize-collecting scheduling.
Jobs may be rejected at a penalty; minimize makespan plus total penalties.
Jobs may be rejected at a penalty; minimize makespan plus total penalties.
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 NKR10R Edit this page History Report an error