Complexity and approximation for precedence constrained scheduling problems with large communication delays (Q935152)
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: Complexity and approximation for precedence constrained scheduling problems with large communication delays |
scientific article; zbMATH DE number 5306534
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and approximation for precedence constrained scheduling problems with large communication delays |
scientific article; zbMATH DE number 5306534 |
Statements
Complexity and approximation for precedence constrained scheduling problems with large communication delays (English)
0 references
31 July 2008
0 references
scheduling with large communication delays
0 references
non-approximability
0 references
approximation
0 references
0 references
0 references
0.9447772
0 references
0.93213236
0 references
0.9210777
0 references
0.91390735
0 references
0.90973884
0 references
