On-line scheduling to minimize Max flow time: an optimal preemptive algorithm (Q813965): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 12:06, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On-line scheduling to minimize Max flow time: an optimal preemptive algorithm |
scientific article |
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