Problemadvanced
Scheduling jobs on three machines
The flow shop scheduling problem with three machines, which is NP-hard in general and solvable by Johnson's rule only under special conditions.
The flow shop scheduling problem with three machines, which is NP-hard in general and solvable by Johnson's rule only under special conditions.
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 F4DF7W Edit this page History Report an error