Makespan minimization in online scheduling with machine eligibility (Q5894207)
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 5873360
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Makespan minimization in online scheduling with machine eligibility |
scientific article; zbMATH DE number 5873360 |
Statements
Makespan minimization in online scheduling with machine eligibility (English)
0 references
1 April 2011
0 references
parallel machine scheduling
0 references
eligibility constraint
0 references
tree-hierarchical and GoS processing sets
0 references
interval and nested processing sets
0 references
online and semi-online scheduling
0 references
offline scheduling
0 references
makespan
0 references
competitive ratio
0 references
0 references
0 references
0 references
0 references
0 references
0.9999991059303284
0 references
0.8872373700141907
0 references
0.8558772206306458
0 references
0.8545219302177429
0 references
0.8502596020698547
0 references
