An Almost-Linear Algorithm for Two-Processor Scheduling (Q3945581): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/322326.322335 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1996256520 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:05, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Almost-Linear Algorithm for Two-Processor Scheduling |
scientific article |
Statements
An Almost-Linear Algorithm for Two-Processor Scheduling (English)
0 references
1982
0 references
graph algorithms, precedence constraints
0 references
critical path scheduling
0 references
highest-level-first scheduling
0 references
directed acyclic graphs
0 references
