Three, four, five, six, or the complexity of scheduling with communication delays (Q1342284)
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 710269
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Three, four, five, six, or the complexity of scheduling with communication delays |
scientific article; zbMATH DE number 710269 |
Statements
Three, four, five, six, or the complexity of scheduling with communication delays (English)
0 references
13 February 1995
0 references
makespan
0 references
identical parallel processors
0 references
precedence constraints
0 references
communication delays
0 references
0.9062735438346864
0 references
0.8852340579032898
0 references
0.8851811289787292
0 references
