Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints (Q3468873): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01415940 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2035609757 / rank | |||
Normal rank | |||
Latest revision as of 10:07, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints |
scientific article |
Statements
Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints (English)
0 references
1989
0 references
tree-like precedence constraints
0 references
two processor scheduling
0 references
schedules for trees
0 references
worst-case absolute error
0 references
