Theoremadvanced
Optimality of SRPT for total flow time
Also called Schrage's theorem.
SRPT minimizes total flow time on a single preemptive machine, and is therefore optimal among online algorithms.
SRPT minimizes total flow time on a single preemptive machine, and is therefore optimal among online algorithms.
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 V78HTH Edit this page History Report an error