Mixed graph colouring as scheduling multi-processor tasks with equal processing times (Q6669643)
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: Mixed graph colouring as scheduling multi-processor tasks with equal processing times |
scientific article; zbMATH DE number 7973360
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mixed graph colouring as scheduling multi-processor tasks with equal processing times |
scientific article; zbMATH DE number 7973360 |
Statements
Mixed graph colouring as scheduling multi-processor tasks with equal processing times (English)
0 references
22 January 2025
0 references
optimisation
0 references
unit-time scheduling
0 references
makespan
0 references
mixed graph
0 references
vertex colouring
0 references
0 references
0 references
