Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times (Q1752203)
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: Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times |
scientific article; zbMATH DE number 6872213
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times |
scientific article; zbMATH DE number 6872213 |
Statements
Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times (English)
0 references
24 May 2018
0 references
workload partition problem
0 references
scheduling
0 references
identical parallel machines
0 references
controllable processing times
0 references
approximation algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8913607
0 references
0.89088064
0 references
0.8878932
0 references
0.88496023
0 references
0.88487434
0 references
0.8840271
0 references
0.88386834
0 references
0.8836159
0 references
