A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors (Q3325433): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q948705 |
Changed an Item |
||
| Property / author | |||
| Property / author: Edward G. jun. Coffman / rank | |||
Normal rank | |||
Revision as of 21:37, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors |
scientific article |
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
