A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors (Q3325433)
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 3856797
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors |
scientific article; zbMATH DE number 3856797 |
Statements
A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors (English)
0 references
1984
0 references
independent tasks
0 references
two identical processors
0 references
expected makespan
0 references
largest- task-first, nonpreemptive approximation rules
0 references
lower bound
0 references
0.8482151031494141
0 references
0.8316031098365784
0 references
0.8305870890617371
0 references
0.8299864530563354
0 references
0.8248374462127686
0 references
