Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling (Q4285627)
From MaRDI portal
scientific article; zbMATH DE number 529928
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling |
scientific article; zbMATH DE number 529928 |
Statements
Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling (English)
0 references
17 April 1994
0 references
makespan scheduling
0 references
preemptive scheduling
0 references
