A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints (Q967430)
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: A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints |
scientific article; zbMATH DE number 5702676
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints |
scientific article; zbMATH DE number 5702676 |
Statements
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints (English)
0 references
28 April 2010
0 references
hypergraph coloring
0 references
dedicated machines
0 references
multiprocessor scheduling
0 references
NP-completeness
0 references
0 references
