Minimizing total completion time on uniform machines with deadline constraints (Q2944508)
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: Minimizing total completion time on uniform machines with deadline constraints |
scientific article; zbMATH DE number 6477839
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing total completion time on uniform machines with deadline constraints |
scientific article; zbMATH DE number 6477839 |
Statements
Minimizing total completion time on uniform machines with deadline constraints (English)
0 references
2 September 2015
0 references
mean flow time
0 references
deadline constraints
0 references
polynomial-time algorithms
0 references
uniform machines
0 references
0.9268165230751038
0 references
0.8254438638687134
0 references
0.8229975700378418
0 references
0.8122128844261169
0 references
0.8095751404762268
0 references
