Scheduling Independent Tasks on Uniform Processors (Q3340132)
From MaRDI portal
!
WARNING
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 3874594
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling Independent Tasks on Uniform Processors |
scientific article; zbMATH DE number 3874594 |
Statements
Scheduling Independent Tasks on Uniform Processors (English)
0 references
1984
0 references
finish time
0 references
approximate algorithm
0 references
worst-case analysis
0 references
longest processing time
0 references
scheduling independent tasks
0 references
uniform processors
0 references
0.927501916885376
0 references
0.8920154571533203
0 references
0.890942394733429
0 references
0.890942394733429
0 references
0.8865158557891846
0 references
