Batch processing with interval graph compatibilities between tasks (Q2476244)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5250567
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Batch processing with interval graph compatibilities between tasks |
scientific article; zbMATH DE number 5250567 |
Statements
Batch processing with interval graph compatibilities between tasks (English)
0 references
18 March 2008
0 references
batch-scheduling
0 references
task compatibilities
0 references
interval graphs
0 references
perfect graphs
0 references
bounded coloring
0 references
Max-coloring
0 references
0 references
0.8664550185203552
0 references
0.8645002245903015
0 references
0.8609710931777954
0 references
0.8496914505958557
0 references
0.8474932312965393
0 references
