Some complexity and approximation results for coupled-tasks scheduling problem according to topology (Q2954345)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some complexity and approximation results for coupled-tasks scheduling problem according to topology |
scientific article |
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
