Scheduling on Two Unbounded Resources with Communication Costs (Q3297565)
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 7222883
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling on Two Unbounded Resources with Communication Costs |
scientific article; zbMATH DE number 7222883 |
Statements
Scheduling on Two Unbounded Resources with Communication Costs (English)
0 references
20 July 2020
0 references
scheduling
0 references
DAG
0 references
makespan
0 references
heterogeneous platform
0 references
0.8882751
0 references
0.88017064
0 references
0.87807715
0 references
0.87539506
0 references
0.8746873
0 references
0.8714706
0 references
0.86699677
0 references
0.8648795
0 references
