Problemcore
Scheduling with release times and deadlines
Asks whether jobs with given processing times, release times and deadlines can run on one machine without overlap, which is NP-complete.
Asks whether jobs with given processing times, release times and deadlines can run on one machine without overlap, which is NP-complete.
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 T16ZNM Edit this page History Report an error