On Approximation Algorithms for Two-Stage Scheduling Problems (Q4632219)
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 7048116
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Approximation Algorithms for Two-Stage Scheduling Problems |
scientific article; zbMATH DE number 7048116 |
Statements
On Approximation Algorithms for Two-Stage Scheduling Problems (English)
0 references
26 April 2019
0 references
completion time
0 references
approximation ratio
0 references
competitive ratio
0 references
online algorithm
0 references
online scheduling
0 references
0 references
0 references
0.9562297
0 references
0.94430554
0 references
0.9227453
0 references
0 references
0.9185947
0 references
0.91775215
0 references
0 references
0.9133806
0 references
