Theoremadvanced
Makespan scheduling inapproximability
Also called P||Cmax hardness.
Minimum makespan on identical machines cannot be approximated within 3/2 - ε unless P = NP.
Minimum makespan on identical machines cannot be approximated within 3/2 - ε unless P = NP.
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 KVD1F4 Edit this page History Report an error