A New Insight into the Coffman–Graham Algorithm (Q4302291)
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 618166
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A New Insight into the Coffman–Graham Algorithm |
scientific article; zbMATH DE number 618166 |
Statements
A New Insight into the Coffman–Graham Algorithm (English)
0 references
14 August 1994
0 references
list scheduling
0 references
nonpreemptable tasks
0 references
precedence graph
0 references
identical processors
0 references
worst case behavior
0 references
Coffman-Graham algorithm
0 references
0.838567316532135
0 references
0.8197948932647705
0 references
0.8032175898551941
0 references
0.8008410930633545
0 references
0.7956663370132446
0 references
