Nearly on line scheduling of preemptive independent tasks (Q1346697)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 741476
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nearly on line scheduling of preemptive independent tasks |
scientific article; zbMATH DE number 741476 |
Statements
Nearly on line scheduling of preemptive independent tasks (English)
0 references
10 April 1995
0 references
polynomial-time algorithms
0 references
scheduling
0 references
performance guarantee
0 references
0 references
0.9203658
0 references
0.9171463
0 references
0.91641855
0 references
0.9097406
0 references
0.9067559
0 references
0.90378946
0 references
