On-line scheduling to minimize Max flow time: an optimal preemptive algorithm (Q813965)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On-line scheduling to minimize Max flow time: an optimal preemptive algorithm |
scientific article; zbMATH DE number 5003053
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On-line scheduling to minimize Max flow time: an optimal preemptive algorithm |
scientific article; zbMATH DE number 5003053 |
Statements
On-line scheduling to minimize Max flow time: an optimal preemptive algorithm (English)
0 references
2 February 2006
0 references
scheduling
0 references
preemption
0 references
on-line algorithms
0 references
Max flow time
0 references
0.9501494
0 references
0.95000863
0 references
0 references
0.92895687
0 references
0.9154767
0 references
0.9141216
0 references
0.9141216
0 references
0.91073275
0 references
