Fast approximation algorithms for uniform machine scheduling with processing set restrictions (Q1753462)
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: Fast approximation algorithms for uniform machine scheduling with processing set restrictions |
scientific article; zbMATH DE number 6875787
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast approximation algorithms for uniform machine scheduling with processing set restrictions |
scientific article; zbMATH DE number 6875787 |
Statements
Fast approximation algorithms for uniform machine scheduling with processing set restrictions (English)
0 references
29 May 2018
0 references
scheduling
0 references
uniform machines
0 references
inclusive processing set
0 references
tree-hierarchical processing set
0 references
makespan
0 references
worst-case bound
0 references
0 references
0 references
0.9363401
0 references
0.9168296
0 references
0.9055942
0 references
0.9048837
0 references
0.9039238
0 references
0.90288025
0 references
0.8981946
0 references
0 references
0.8952929
0 references
