Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph (Q2865876)
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: Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph |
scientific article; zbMATH DE number 6237553
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph |
scientific article; zbMATH DE number 6237553 |
Statements
11 December 2013
0 references
complexity
0 references
approximation algorithm
0 references
scheduling
0 references
coupled-tasks
0 references
Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph (English)
0 references
0.8882239460945129
0 references
0.8746271133422852
0 references
0.8693254590034485
0 references
0.8301907777786255
0 references
0.8281943202018738
0 references
