Problemadvanced
Unrelated machine scheduling (makespan)
Also called R||Cmax.
Assign jobs to unrelated machines to minimise the largest completion time.
Assign jobs to unrelated machines to minimise the largest completion time.
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 AR3HAW Edit this page History Report an error