An Almost-Linear Algorithm for Two-Processor Scheduling (Q3945581)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An Almost-Linear Algorithm for Two-Processor Scheduling |
scientific article; zbMATH DE number 3763285
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Almost-Linear Algorithm for Two-Processor Scheduling |
scientific article; zbMATH DE number 3763285 |
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
