Fast approximation algorithms for bi-criteria scheduling with machine assignment costs (Q296690)
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 6597467
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast approximation algorithms for bi-criteria scheduling with machine assignment costs |
scientific article; zbMATH DE number 6597467 |
Statements
Fast approximation algorithms for bi-criteria scheduling with machine assignment costs (English)
0 references
23 June 2016
0 references
bi-criteria scheduling
0 references
maximum machine cost
0 references
total machine cost
0 references
makespan
0 references
total completion time
0 references
heuristics
0 references
0 references
0 references
0 references
0.8585803508758545
0 references
0.8334463834762573
0 references
0.8312075138092041
0 references
0.8139259219169617
0 references
