Some complexity and approximation results for coupled-tasks scheduling problem according to topology (Q2954345)
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 6674241
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some complexity and approximation results for coupled-tasks scheduling problem according to topology |
scientific article; zbMATH DE number 6674241 |
Statements
Some complexity and approximation results for coupled-tasks scheduling problem according to topology (English)
0 references
12 January 2017
0 references
coupled-task scheduling model
0 references
complexity
0 references
polynomial-time approximation algorithm
0 references
0 references
0 references
0 references
0 references
0.9316149353981018
0 references
0.8693254590034485
0 references
0.8306342959403992
0 references
0.8265605568885803
0 references
0.8235164880752563
0 references
