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 this page instead for the normal view: Three, four, five, six, or the complexity of scheduling with communication delays |
scientific article; zbMATH DE number 710269
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
