Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time (Q4561187)
From MaRDI portal
scientific article; zbMATH DE number 6991468
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time |
scientific article; zbMATH DE number 6991468 |
Statements
Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time (English)
0 references
10 December 2018
0 references
scheduling
0 references
online algorithm
0 references
best-possible competitive ratio
0 references
0 references
0 references
0 references
