Scheduling on unrelated machines under tree-like precedence constraints (Q2391177)
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: Scheduling on unrelated machines under tree-like precedence constraints |
scientific article; zbMATH DE number 5586532
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling on unrelated machines under tree-like precedence constraints |
scientific article; zbMATH DE number 5586532 |
Statements
Scheduling on unrelated machines under tree-like precedence constraints (English)
0 references
24 July 2009
0 references
precedence-constrained scheduling
0 references
job-shop scheduling
0 references
approximation algorithms
0 references
randomized algorithms
0 references
0 references
0 references
0 references
0 references
0.9917937517166138
0 references
0.8552792072296143
0 references
0.8481122255325317
0 references
0.8462080359458923
0 references
