Complexity and approximation results for scheduling multiprocessor tasks on a ring. (Q1417558)
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 results for scheduling multiprocessor tasks on a ring. |
scientific article; zbMATH DE number 2021213
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and approximation results for scheduling multiprocessor tasks on a ring. |
scientific article; zbMATH DE number 2021213 |
Statements
Complexity and approximation results for scheduling multiprocessor tasks on a ring. (English)
0 references
5 January 2004
0 references
Multiprocessor task scheduling
0 references
Graph model
0 references
Acyclic orientations
0 references
Complexity analysis
0 references
Approximation results
0 references
