Total completion time minimization scheduling on two hierarchical uniform machines (Q1676324)
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 6803107
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Total completion time minimization scheduling on two hierarchical uniform machines |
scientific article; zbMATH DE number 6803107 |
Statements
Total completion time minimization scheduling on two hierarchical uniform machines (English)
0 references
6 November 2017
0 references
online scheduling
0 references
hierarchy
0 references
total completion time
0 references
competitive ratio
0 references
0 references
0 references
0.9149378
0 references
0.9090906
0 references
0.90201575
0 references
0.90175605
0 references
0.8978642
0 references
0 references
0.8924707
0 references
