Graph models for scheduling systems with machine saturation property (Q883067)
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 5159734
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph models for scheduling systems with machine saturation property |
scientific article; zbMATH DE number 5159734 |
Statements
Graph models for scheduling systems with machine saturation property (English)
0 references
31 May 2007
0 references
Makespan
0 references
Multiprocessor task scheduling
0 references
Polynomial algorithms
0 references
Intersection graphs
0 references
0.7842549085617065
0 references
0.7808845043182373
0 references
0.7760348320007324
0 references
